Performance of adaptive space sharing processor allocation policies for distributed-memory multicomputers

被引:6
作者
Dandamudi, SP [1 ]
Yu, H [1 ]
机构
[1] Carleton Univ, Ctr Parallel & Distributed Comp, Sch Comp Sci, Ottawa, ON K1S 5B6, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
processor scheduling; space sharing policies; distributed-memory multicomputer systems; job structure; performance evaluation;
D O I
10.1006/jpdc.1999.1544
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Several space sharing policies have been proposed for distributed-memory multicomputer systems. We consider adaptive space sharing policies, as these policies provide a better performance than fixed and static policies by taking system load and user requirements into account. In this paper we propose an improved space sharing policy by suggesting a simple modification to a previously proposed policy. We study performance sensitivity of the original and modified policies to job structure and various other system and workload parameters like variances in inter-arrival times and job service times. The results presented here demonstrate that the modified policy performs substantially better than the original policy. (C) 1999 Academic Press.
引用
收藏
页码:109 / 125
页数:17
相关论文
共 21 条
[1]   Parallel application scheduling on networks of workstations [J].
Anastasiadis, SV ;
Sevcik, KC .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1997, 43 (02) :109-124
[2]  
[Anonymous], LNCS
[3]  
[Anonymous], P SIGMETRICS APR
[4]  
AU SL, 1996, J COMPUTERS THEIR AP, V3, P17
[5]  
AYACHI S, 1996, IEEE S PAR DISTR PRO, P100
[6]   Reducing run queue contention in shared memory multiprocessors [J].
Dandamudi, SP .
COMPUTER, 1997, 30 (03) :82-+
[7]   A HIERARCHICAL TASK QUEUE ORGANIZATION FOR SHARED-MEMORY MULTIPROCESSOR SYSTEMS [J].
DANDAMUDI, SP ;
CHENG, PSP .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (01) :1-16
[8]  
DANDAMUDI SP, 1997, INT C HIGH PERF COMP, P218
[9]  
Feitelson DG, 1997, LECT NOTES COMPUT SC, V1291, P1
[10]  
FEITELSON DG, 1995, LECT NOTES COMPUTER