Don't Hurry be Happy: a Deadline-based Backfilling Approach - Archive ouverte HAL Access content directly
Conference Papers Year :

Don't Hurry be Happy: a Deadline-based Backfilling Approach

(1) , (2, 3)
1
2
3

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 Backlling (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 nish. 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 dierent workloads show that the proposed algorithm signicantly reduces the average wait time and average stretch when compared to Conservative Backlling.
Fichier principal
Vignette du fichier
jsspp_article.pdf (1.38 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01672484 , version 1 (25-12-2017)

Identifiers

  • HAL Id : hal-01672484 , version 1

Cite

Tchimou N 'Takpé, Frédéric Suter. Don't Hurry be Happy: a Deadline-based Backfilling Approach. JSSPP 2017 - 21st Workshop on Job Scheduling Strategies for Parallel Processing, Jun 2017, Orlando, FL, United States. pp.1-20. ⟨hal-01672484⟩
160 View
171 Download

Share

Gmail Facebook Twitter LinkedIn More