Job fairness in non-preemptive job scheduling
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 186-194 vol.1
- https://doi.org/10.1109/icpp.2004.1327920
Abstract
Job scheduling has been a much studied topic over the years. While past research has studied the effect of various scheduling policies using metrics such as turnaround time, slowdown, utilization etc., there has been little research on how fair a nonpreemptive scheduling policy is. We propose an approach to assessing fairness in nonpreemptive job scheduling. Our basic model of fairness is that no later arriving job should delay an earlier arriving job. We quantitatively assess the fairness of several job scheduling strategies and propose a new strategy that seeks to improve fairness.Keywords
This publication has 15 references indexed in Scilit:
- Classifying scheduling policies with respect to unfairness in an M/GI/1Published by Association for Computing Machinery (ACM) ,2003
- The Impact of More Accurate Requested Runtimes on Production Job Scheduling PerformancePublished by Springer Nature ,2002
- Selective Reservation Strategies for Backfill Job SchedulingPublished by Springer Nature ,2002
- 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
- Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable UtilizationPublished by Springer Nature ,1999
- 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