Memory conscious scheduling for cluster-based NUMA multiprocessors

被引:2
|
作者
Koita, T [1 ]
Katayama, T [1 ]
Saisho, K [1 ]
Fukuda, A [1 ]
机构
[1] Nara Inst Sci & Technol, Nara 6300101, Japan
来源
JOURNAL OF SUPERCOMPUTING | 2000年 / 16卷 / 03期
关键词
processor scheduling; dynamic space-sharing; page placement; cluster-based NUMA multiprocessors; multiprogrammed environments;
D O I
10.1023/A:1008165010732
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
For Non-Uniform Memory Access (NUMA) multiprocessors, memory access overhead is crucial to system performance. Processor scheduling and page placement schemes, dominant factors of memory access overhead, are closely related. In particular, if the processor scheduling scheme is dynamic space-sharing, it should be considered together with the page placement scheme for efficient process execution. Most research in this area, however, has focused exclusively on either the processor scheduling scheme or the page placement scheme alone without considering the interaction between the two. This paper proposes several policies for cluster-based NUMA multiprocessors that are combinations of a processor scheduling scheme and a page placement scheme and investigates the interaction between them. The simulation results show that policies that cooperate to employ the home-cluster concept achieve the best performance. The paper also compares the best of the proposed policies with other existing dynamic processor scheduling policies. Based on our study reported here, the best policy is found to perform better than other existing policies.
引用
收藏
页码:217 / 235
页数:19
相关论文
共 50 条
  • [1] Memory Conscious Scheduling for Cluster-based NUMA Multiprocessors
    Takahiro Koita
    Tetsuro Katayama
    Keizo Saisho
    Akira Fukuda
    The Journal of Supercomputing, 2000, 16 : 217 - 235
  • [2] Processor scheduling with page placement for cluster-based NUMA multiprocessors
    Koita, T
    Katayama, T
    Saisho, K
    Fukuda, A
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 851 - 858
  • [3] 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
  • [4] 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
  • [5] Home-cluster based processor scheduling with page placement for NUMA multiprocessors
    Koita, T
    Katayama, T
    Saisho, K
    Fukuda, A
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, 1999, : 539 - 545
  • [6] PERFORMANCE ANALYSIS OF CLUSTER-BASED MULTIPROCESSORS
    MOHAPATRA, P
    DAS, CR
    FENG, TY
    IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (01) : 109 - 114
  • [7] 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
  • [8] EXPERIMENTAL COMPARISON OF MEMORY MANAGEMENT POLICIES FOR NUMA MULTIPROCESSORS
    LAROWE, RP
    ELLIS, CS
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1991, 9 (04): : 319 - 363
  • [9] Clustered affinity scheduling on large-scale NUMA multiprocessors
    Wang, YM
    Wang, HH
    Chang, RC
    JOURNAL OF SYSTEMS AND SOFTWARE, 1997, 39 (01) : 61 - 70
  • [10] A study of the efficiency of shared attraction memories in cluster-based COMA multiprocessors
    Landin, A
    Karlgren, M
    11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, : 1 - 7