Selective preemption strategies for parallel job scheduling
- 25 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01903918,p. 602-610
- https://doi.org/10.1109/icpp.2002.1040918
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
This publication has 12 references indexed in Scilit:
- Core Algorithms of the Maui SchedulerPublished by Springer Nature ,2001
- Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfillingIEEE Transactions on Parallel and Distributed Systems, 2001
- Randomization, Speculation, and Adaptation in Batch SchedulersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2000
- Preemptive Scheduling of Parallel Jobs on MultiprocessorsSIAM Journal on Computing, 2000
- Implementing multiprocessor scheduling disciplinesPublished by Springer Nature ,1997
- Theory and practice in parallel job schedulingPublished by Springer Nature ,1997
- The EASY — LoadLeveler API projectPublished by Springer Nature ,1996
- The ANL/IBM SP scheduling systemPublished by Springer Nature ,1995
- Application scheduling and processor allocation in multiprogrammed parallel processing systemsPerformance Evaluation, 1994
- The performance of multiprogrammed multiprocessor scheduling algorithmsACM SIGMETRICS Performance Evaluation Review, 1990