Page placement is a critical problem for memoryintensive applications running on a shared-memory multiprocessor with a non-uniform memory access (NUMA) architecture. State-of-the-art page placement mechanisms interleave pages evenly across NUMA nodes. However, this approach fails to maximize memory throughput in modern NUMA systems, characterised by asymmetric bandwidths and latencies, and sensitive to memory contention and interconnect congestion phenomena. We propose BWAP, a novel page placement mechanism based on asymmetric weighted page interleaving. BWAP combines an analytical performance model of the target NUMA system with on-line iterative tuning of page distribution for a given memory-intensive application. Our experimental evaluation with representative memory-intensive workloads shows that BWAP performs up to 66% better than state-of-the-art techniques. These gains are particularly relevant when multiple co-located applications run in disjoint partitions of a large NUMA machine or when applications do not scale up to the total number of cores.

翻译：页面放置是运行在非一致性内存访问（NUMA）架构共享内存多处理器上的内存密集型应用面临的关键问题。现有页面放置机制将页面均匀交错分布在NUMA节点间，但此方法无法在现代NUMA系统中实现内存吞吐量最大化——这些系统具有非对称带宽和延迟特征，且对内存竞争与互连拥塞现象敏感。我们提出BWAP，一种基于非对称加权页面交错的新型页面放置机制。BWAP将目标NUMA系统的分析性能模型与针对特定内存密集型应用的在线迭代页面分布调优相结合。基于代表性内存密集型工作负载的实验评估表明，BWAP的性能比现有技术最高提升66%。当多个共置应用在大型NUMA机器的独立分区中运行，或应用无法扩展到全部核心数时，此性能增益尤为显著。