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 条
  • [1] Design and analysis of static memory management policies for CC-NUMA multiprocessors
    Iyer, R
    Wang, HJ
    Bhuyan, LN
    JOURNAL OF SYSTEMS ARCHITECTURE, 2002, 48 (1-3) : 59 - 80
  • [2] PAGE PLACEMENT POLICIES FOR NUMA MULTIPROCESSORS
    LAROWE, RP
    ELLIS, CS
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 11 (02) : 112 - 129
  • [3] Impact of memory contention on dynamic scheduling on NUMA multiprocessors
    Durand, D
    Montaut, T
    Kervella, L
    Jalby, W
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (11) : 1201 - 1214
  • [4] An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors
    Brecht, TB
    JOB SCHEDULING STRATEGIES FOR PARALLEL PROCESSING, 1997, 1291 : 139 - 165
  • [5] Memory conscious scheduling for cluster-based NUMA multiprocessors
    Koita, T
    Katayama, T
    Saisho, K
    Fukuda, A
    JOURNAL OF SUPERCOMPUTING, 2000, 16 (03): : 217 - 235
  • [6] Memory Conscious Scheduling for Cluster-based NUMA Multiprocessors
    Takahiro Koita
    Tetsuro Katayama
    Keizo Saisho
    Akira Fukuda
    The Journal of Supercomputing, 2000, 16 : 217 - 235
  • [7] NUMA POLICIES AND THEIR RELATION TO MEMORY ARCHITECTURE
    BOLOSKY, WJ
    SCOTT, ML
    FITZGERALD, RP
    FOWLER, RJ
    COX, AL
    SIGPLAN NOTICES, 1991, 26 (04): : 212 - 223
  • [8] Compiler Support for Array Distribution on NUMA Shared Memory Multiprocessors
    Tarek S. Abdelrahman
    Thomas N. Wong
    The Journal of Supercomputing, 1998, 12 : 349 - 371
  • [9] Compiler support for array distribution on NUMA shared memory multiprocessors
    Abdelrahman, TS
    Wong, TN
    JOURNAL OF SUPERCOMPUTING, 1998, 12 (04): : 349 - 371
  • [10] An effective shared memory allocator for reducing false sharing in NUMA multiprocessors
    Lee, JW
    Cho, YK
    1996 IEEE SECOND INTERNATIONAL CONFERENCE ON ALGORITHMS & ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP'96, PROCEEDINGS OF, 1996, : 373 - 382