DocumentCode :
1347525
Title :
Processor saving scheduling policies for multiprocessor systems
Author :
Rosti, Emilia ; Smirni, Evgenia ; Dowdy, Lawrence W. ; Serazzi, Giuseppe ; Sevcik, Kenneth C.
Author_Institution :
Dipartimento di Sci. dell´´Inf., Milan Univ., Italy
Volume :
47
Issue :
2
fYear :
1998
fDate :
2/1/1998 12:00:00 AM
Firstpage :
178
Lastpage :
189
Abstract :
In this paper, processor scheduling policies that “save” processors are introduced and studied. In a multiprogrammed parallel system, a “processor saving” scheduling policy purposefully keeps some of the available processors idle in the presence of work to be done. The conditions under which processor saving policies can be more effective than their greedy counterparts, i.e., policies that never leave processors idle in the presence of work to be done, are examined. Sensitivity analysis is performed with respect to application speedup, system size, coefficient of variation of the applications´ execution time, variability in the arrival process, and multiclass workloads. Analytical, simulation, and experimental results show that processor saving policies outperform their greedy counterparts under a variety of system and workload characteristics
Keywords :
multiprocessing systems; performance evaluation; processor scheduling; Markov analysis; multiprocessor systems; multiprogrammed parallel system; performance evaluation; processor saving; processor scheduling; sensitivity analysis; work conserving; Analytical models; Computer Society; Computer science; Concurrent computing; Delay; Fluctuations; Multiprocessing systems; Parallel processing; Processor scheduling; Sensitivity analysis;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.663764
Filename :
663764
Link To Document :
بازگشت