Variations of Conservative Backfilling to Improve Fairness
We apply recent variations of Conservative backfilling in an effort to improve scheduler fairness. These variations modify the compression operation while preserving the key property that jobs never move later in the profile. We assess the variations using two measures of job-level fairness. Each of the variations turns out to be better than Conservative according to one of the metrics.
KeywordsSchedule Algorithm Fair Share Priority Function Actual Processing Time Compression Operation
We thank the anonymous referees for their helpful comments. A. Rajbhandary and D.P. Bunde were partially supported by contract 899808 from Sandia National Laboratories. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. We also thank all those who contributed traces to the Parallel Workloads Archive.
- 2.Feitelson, D.: The parallel workloads archive. http://www.cs.huji.ac.il/labs/parallel/workload/index.html
- 3.Feitelson, D.: Personal communication (2013)Google Scholar
- 6.Leung, V.J., Sabin, G., Sadayappan, P.: Parallel job scheduling policies to improve fairness: a case study. In: Proceedings of the 6th International Workshop on Scheduling and Resource Management for Parallel and Distributed Systems (2010)Google Scholar
- 11.Perković, D., Keleher, P.J.: Randomization, speculation, and adaptation in batch schedulers. In: Proceedings of the 2000 ACM/IEEE Conference on Supercomputing (2000)Google Scholar
- 12.Rajbhandary, A.: Fairness in scheduling algorithms. Honors thesis, Knox College (2013)Google Scholar
- 13.Raz, D., Avi-Itzhak, B., Levy, H.: Fairness considerations in multi-server and multi-queue systems. In: Proceedings of the 1st International Conference on Performance Evaluation Methodologies and Tools (2006)Google Scholar
- 14.Sabin, G., Kochhar, G., Sadayappan, G.: Job fairness in non-preeemptive job scheduling. In: Proceedings of the International Conference on Parallel Processing (ICPP) (2004)Google Scholar
- 20.Tsafrir, D., Feitelson, D.G.: The dynamics of backfilling: solving the mystery of why increased inaccuracy may help. In: Proceedings of the IEEE International Symposium on Workload Characterization, pp. 131–141 (2006)Google Scholar