Don't Hurry Be Happy: A Deadline-Based Backfilling Approach

• Published in: Job Scheduling Strategies for Parallel Processing Vol. 10773; pp. 62 - 82
• Main Authors: N’takpé, Tchimou, Suter, Frédéric
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2018; Springer International Publishing
• Series: Lecture Notes in Computer Science
• ISBN: 9783319773971; 3319773976
• ISSN: 0302-9743; 1611-3349; 1611-3349
• DOI: 10.1007/978-3-319-77398-8_4

Computing resources in data centers are usually managed by a Resource and Job Management System whose main objective is to complete submitted jobs as soon as possible while maximizing resource usage and ensuring fairness among users. However, some users might not be as hurried as the job scheduler but only interested in their jobs to complete before a given deadline. In this paper, we derive from this initial hypothesis a low-complexity scheduling algorithm, called Deadline-Based Backfilling (DBF), that distinguishes regular jobs that have to complete as early as possible from deadline-driven jobs that come with a deadline before when they have to finish. We also investigate a scenario in which deadline-driven jobs are submitted and evaluate the impact of the proposed algorithm on classical performance metrics with regard to state-of-the-art scheduling algorithms. Experiments conducted on four different workloads show that the proposed algorithm significantly reduces the average wait time and average stretch when compared to Conservative Backfilling.