Performance evaluation of home-cluster based scheduling for NUMA multiprocessors

被引:0
作者
Koita, T [1 ]
Katayama, T [1 ]
Saisho, K [1 ]
Fukuda, A [1 ]
机构
[1] Osaka Sangyo Univ, Osaka, Japan
来源
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V | 2000年
关键词
processor scheduling; page placement; NUMA multiprocessors; multiprogrammed environments; home-cluster;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
For Non-Uniform Memory Access (NUMA) multiprocessors, memory access overhead is crucial to system performance. The memory access overhead strongly depends on the processor scheduling scheme and the page placement scheme. When a thread in a process accesses virtual pages allocated in remote memories during its execution, the thread is not efficiently executed due to remote memory access overhead. Therefore, the processor scheduling scheme and the page placement scheme should work cooperatively for efficient process execution. A home-cluster based processor scheduling is a kind of cooperative scheduling scheme that works with the page placement scheme using the notion of the home-cluster. This paper investigates the performance of the home-cluster based policy that consists of a processor scheduling scheme and a page placement scheme that are based on the home-cluster for cluster-based NUMA multiprocessors. The home-cluster based policy is compared with other existing policies, which focus on only processor scheduling rather than page placement scheme. Those policies are examined through the simulation experiments by using a process execution model, MVA process model). The simulation results show that mean response time with the home-cluster based policy is shorter than that with the other existing ones because of reducing remote memory access overhead. That means that the home-cluster based policy gives better system performance than the other existing ones.
引用
收藏
页码:1939 / 1945
页数:7
相关论文
共 14 条
[1]  
ALMQUIST K, 1989, P INT C PAR PROC, V3, P76
[2]  
Brecht TB, 1996, PERFORM EVALUATION, V27-8, P519
[3]  
GUPTA A, 1991, P 1991 ACM SIGMETRIC, P120
[4]  
Koita T., 1998, Proceedings of the 16th IASTED International Conference. Applied Informatics, P265
[5]   Memory conscious scheduling for cluster-based NUMA multiprocessors [J].
Koita, T ;
Katayama, T ;
Saisho, K ;
Fukuda, A .
JOURNAL OF SUPERCOMPUTING, 2000, 16 (03) :217-235
[6]   EXPERIMENTAL COMPARISON OF MEMORY MANAGEMENT POLICIES FOR NUMA MULTIPROCESSORS [J].
LAROWE, RP ;
ELLIS, CS .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1991, 9 (04) :319-363
[7]  
LAROWE RP, 1991, P 13 ACM S OP SYST P, P137
[8]   THE DASH PROTOTYPE - LOGIC OVERHEAD AND PERFORMANCE [J].
LENOSKI, D ;
LAUDON, J ;
JOE, T ;
NAKAHIRA, D ;
STEVENS, L ;
GUPTA, A ;
HENNESSY, J .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (01) :41-61
[9]   A DYNAMIC PROCESSOR ALLOCATION POLICY FOR MULTIPROGRAMMED SHARED-MEMORY MULTIPROCESSORS [J].
MCCANN, C ;
VASWANI, R ;
ZAHORJAN, J .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1993, 11 (02) :146-178
[10]  
NOBUKUNI Y, 1997, INT S HIGH PERF COMP, P255