EXPERIMENTAL COMPARISON OF MEMORY MANAGEMENT POLICIES FOR NUMA MULTIPROCESSORS

被引:31
|
作者
LAROWE, RP [1 ]
ELLIS, CS [1 ]
机构
[1] DUKE UNIV,DEPT COMP SCI,DURHAM,NC 27706
来源
关键词
EXPERIMENTATION; MANAGEMENT; MEASUREMENT; PERFORMANCE;
D O I
10.1145/118544.118546
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Nonuniformity of memory access is an almost inevitable feature of the memory architecture in shared memory multiprocessor designs that can scale to large numbers of processors. One implication of NUMA architectures is that the placement and movement of code and data are crucial to performance. As memory architectures become more complex and the nonuniformity becomes less well hidden, system software must assume a larger role in providing memory management support for the programmer. This paper investigates the role of the operating system. We take an experimental approach to evaluating a wide-range of memory management policies. The target NUMA environment is BBN's GP-1000 multiprocessor. Extensive local modifications have been made to the memory management subsystem of BBN's nX operating system to support multiple policy implementations. Policy comparisons are based on the measured performance of real parallel applications. Our results show that there are memory management policies implemented in our system that can improve the performance of programs written using the simpler uniform memory access (UMA) programming model. While achieving the level of performance of a highly tuned NUMA program is still a difficult problem, some examples come close. There appears to be no single policy that can be considered the best over our set of test applications. Investigations into the contributions made by individual policy features toward overall behavior of the workload provide some insight into the design of a set of effective policies.
引用
收藏
页码:319 / 363
页数:45
相关论文
共 50 条
  • [41] SHARED MEMORY MULTIPROCESSORS
    DEBENEDICTIS, EP
    COMMUNICATIONS OF THE ACM, 1992, 35 (12) : 15 - 15
  • [42] Performance evaluation of two-level scheduling algorithms for NUMA multiprocessors
    Nara Inst of Science and Technology, Ikoma, Japan
    Syst Comput Jpn, 2 (36-46):
  • [43] Performance evaluation of home-cluster based scheduling for NUMA multiprocessors
    Koita, T
    Katayama, T
    Saisho, K
    Fukuda, A
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, : 1939 - 1945
  • [44] MEMORY ALLOCATION FOR MULTIPROCESSORS
    ROSENE, AF
    IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (05): : 659 - &
  • [45] Design and evaluation of a switch cache architecture for CC-NUMA multiprocessors
    Iyer, RR
    Bhuyan, LN
    IEEE TRANSACTIONS ON COMPUTERS, 2000, 49 (08) : 779 - 797
  • [46] Memory-aware kernel mechanism and policies for improving internode load balancing on NUMA systems
    Chiang, Mei-Ling
    Su, Wei-Lun
    Tu, Shu-Wei
    Lin, Zhen-Wei
    SOFTWARE-PRACTICE & EXPERIENCE, 2019, 49 (10): : 1485 - 1508
  • [47] NumaMMA: NUMA MeMory Analyzer
    Trahay, Francois
    Selva, Manuel
    Morel, Lionel
    Marquet, Kevin
    PROCEEDINGS OF THE 47TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2018,
  • [48] Comparison of algorithms for transient stability simulations on shared and distributed memory multiprocessors
    LaScala, M
    Sblendorio, G
    Bose, A
    Wu, JQ
    IEEE TRANSACTIONS ON POWER SYSTEMS, 1996, 11 (04) : 2045 - 2050
  • [49] NUMA Distance for Heterogeneous Memory
    Williams, Sean
    Ionkov, Latchesar
    Lang, Michael
    PROCEEDINGS OF MCHPC'17: WORKSHOP ON MEMORY CENTRIC PROGRAMMING FOR HPC, 2017, : 30 - 34
  • [50] NUMAPROF, A NUMA Memory Profiler
    Valat, Sebastien
    Bouizi, Othman
    EURO-PAR 2018: PARALLEL PROCESSING WORKSHOPS, 2019, 11339 : 159 - 170