Memory Conscious Scheduling for Cluster-based NUMA Multiprocessors

被引:0
作者
Takahiro Koita
Tetsuro Katayama
Keizo Saisho
Akira Fukuda
机构
[1] Nara Institute of Science and Technology,
[2] Nara Institute of Science and Technology,undefined
[3] Nara Institute of Science and Technology,undefined
[4] Nara Institute of Science and Technology,undefined
来源
The Journal of Supercomputing | 2000年 / 16卷
关键词
processor scheduling; dynamic space-sharing; page placement; cluster-based NUMA multiprocessors; multiprogrammed environments;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:18
相关论文
共 21 条
[1]  
Kai H.(1994)Two-level scheduling for multiprogrammed multiprocessors--its structure and performance Transactions of the Information Processing Society Japan 35 2115-2127
[2]  
Fujiki R.(1991)Experimental comparison of memory management policies for NUMA multiprocessors ACM Transactions on Computer Systems 9 319-363
[3]  
Fukuda A.(1991)The robustness of NUMA memory management Operating System Review 25 137-151
[4]  
LaRowe R. P.(1993)The DASH prototype: logic overhead and performance IEEE Transactions on Parallel and Distributed Systems 4 41-61
[5]  
Ellis C. S.(1993)A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors ACM Transactions on Computer Systems 11 146-178
[6]  
LaRowe R. P.(1997)Performance evaluation of two-level scheduling algorithms for NUMA multiprocessors IEICE Transactions on Information and System J80–D1 31-41
[7]  
Ellis C. S.(undefined)undefined undefined undefined undefined-undefined
[8]  
Kaplan L. S.(undefined)undefined undefined undefined undefined-undefined
[9]  
Lenoski D.(undefined)undefined undefined undefined undefined-undefined
[10]  
Laudon J.(undefined)undefined undefined undefined undefined-undefined