@inproceedings{e0da2158121648668334d0838ec2c770,
title = "Don{\textquoteright}t Hurry Be Happy: A Deadline-Based Backfilling Approach",
abstract = "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.",
author = "Tchimou N{\textquoteright}takp{\'e} and Fr{\'e}d{\'e}ric Suter",
note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 21st International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2017 ; Conference date: 02-06-2017 Through 02-06-2017",
year = "2018",
doi = "10.1007/978-3-319-77398-8_4",
language = "English",
isbn = "9783319773971",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "62--82",
editor = "Narayan Desai and Dalibor Klusacek and Walfredo Cirne",
booktitle = "Job Scheduling Strategies for Parallel Processing - 21st International Workshop, JSSPP 2017,Revised Selected Papers",
}