Issue No. 04 - April (2014 vol. 25)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2013.88
Yulai Yuan , Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
Yongwei Wu , Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
Weimin Zheng , Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
Keqin Li , Dept. of Comput. Sci., State Univ. of New York, New Paltz, NY, USA
As the most widely used parallel job scheduling strategy, EASY backfilling achieved great success, not only because it can balance fairness and performance, but also because it is universally applicable to most HPC systems. However, unfairness still exists in EASY. Our simulation shows that a blocked job can be delayed by later jobs for more than 90 hours on real workloads. Additionally, directly employing runtime prediction techniques in EASY would lead to a serious situation called reservation violation. In this paper, we aim at guaranteeing strict fairness (no job is delayed by any jobs of lower priority) while achieving attractive performance, and employing prediction without causing reservation violation in parallel job scheduling. We propose two novel strategies, namely, shadow load preemption (SLP) and venture backfilling (VB), which are integrated into EASY to construct preemptive venture EASY backfilling (PV-EASY). Experimental results on three real HPC workloads demonstrate that PV-EASY is more attractive than EASY in parallel job scheduling, from both academic and industry perspectives.
Runtime, Processor scheduling, Job shop scheduling, Delays, Program processors
Yulai Yuan, Yongwei Wu, Weimin Zheng and Keqin Li, "Guarantee Strict Fairness and UtilizePrediction Better in Parallel Job Scheduling," in IEEE Transactions on Parallel & Distributed Systems, vol. 25, no. 4, pp. 971-981, 2014.