DocumentCode
382744
Title
Selective preemption strategies for parallel job scheduling
Author
Kettimuthu, Rajkumar ; Subramani, Vijay ; Srinivasan, Srividya ; Gopalasamy, Thiagaraja ; Panda, D.K. ; Sadayappan, P.
Author_Institution
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
fYear
2002
fDate
2002
Firstpage
602
Lastpage
610
Abstract
Although theoretical results have been established regarding the utility of pre-emptive scheduling in reducing average job turn-around time, job suspension/restart is not much used in practice at supercomputer centers for parallel job scheduling. A number of questions remain unanswered regarding the practical utility of pre-emptive scheduling. We explore this issue through a simulation-based study, using job logs from a supercomputer center We develop a tunable selective-suspension strategy, and demonstrate its effectiveness. We also present new insights into the effect of pre-emptive scheduling on different job classes and address the impact of suspensions on worst-case slowdown.
Keywords
parallel machines; probability; processor scheduling; job logs; parallel job scheduling; preemptive scheduling; probability; supercomputer; tunable selective-suspension strategy; workload characterization; worst case slowdown; Concurrent computing; Information science; Laboratories; Performance evaluation; Processor scheduling; Runtime; Supercomputers;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 2002. Proceedings. International Conference on
ISSN
0190-3918
Print_ISBN
0-7695-1677-7
Type
conf
DOI
10.1109/ICPP.2002.1040918
Filename
1040918
Link To Document