Improving Backfilling by using Machine Learning to predict Running Times

Abstract : The job management system is the HPC middleware responsible for distributing computing power to applications. While such systems generate an ever increasing amount of data, they are characterized by uncertainties on some parameters like the job running times. The question raised in this work is: To what extent is it possible/useful to take into account predictions on the job running times for improving the global scheduling? We present a comprehensive study for answering this question assuming the popular EASY backfilling policy. More precisely, we rely on some classical methods in machine learning and propose new cost functions well-adapted to the problem. Then, we assess our proposed solutions through intensive simulations using several production logs. Finally, we propose a new scheduling algorithm that outperforms the popular EASY backfilling algorithm by 28% considering the average bounded slowdown objective.
Liste complète des métadonnées

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01221186
Contributor : Valentin Reis <>
Submitted on : Tuesday, October 27, 2015 - 3:33:50 PM
Last modification on : Thursday, April 4, 2019 - 10:18:05 AM
Document(s) archivé(s) le : Friday, April 28, 2017 - 6:34:19 AM

File

paper.pdf
Files produced by the author(s)

Licence


Copyright

Identifiers

Collections

INRIA | UGA | LIG

Citation

Eric Gaussier, David Glesser, Valentin Reis, Denis Trystram. Improving Backfilling by using Machine Learning to predict Running Times. SuperComputing 2015, Nov 2015, Austin, TX, United States. ⟨10.1145/2807591.2807646⟩. ⟨hal-01221186⟩

Share

Metrics

Record views

708

Files downloads

1034