Selective Preemption Strategies for Parallel Job Scheduling

Authors:
Rajkumar Kettimuthu;Vijay Subramani;Srividya Srinivasan;Thiagaraja Gopalasamy
Affiliations:
-;-;-;-
Venue:
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Year:
2002

Citing 0
Cited 4

Another approach to backfilled jobs: applying virtual malleability to expired windows

Proceedings of the 19th annual international conference on Supercomputing
Adaptive Parallel Job Scheduling with Flexible Coscheduling

IEEE Transactions on Parallel and Distributed Systems
Service control with the preemptive parallel job scheduler Scojo-PECT

Cluster Computing
Coarse-grain time slicing with resource-share control in parallel-job scheduling

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Although theoretical results have been established regarding the utility of preemptive 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 remainunanswered regarding the practical utility of preemptive 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.