Resilient Scheduling Heuristics for Rigid Parallel Jobs - Archive ouverte HAL Access content directly
Journal Articles International Journal of Networking and Computing Year : 2021

Resilient Scheduling Heuristics for Rigid Parallel Jobs

(1, 2) , (3) , (4) , (1, 2, 5) , (6)
1
2
3
4
5
6

Abstract

This paper focuses on the resilient scheduling of parallel jobs on high-performance computing (HPC) platforms to minimize the overall completion time, or the makespan. We revisit the classical problem while assuming that jobs are subject to failures caused by transient or silent errors, and hence may need to be re-executed each time they fail to complete successfully. This work generalizes the classical framework where jobs are known offline and do not fail: in this framework, list scheduling that gives priority to the longest jobs is known to be a 3approximation when imposing to use shelves, and a 2-approximation without this restriction. We show that when jobs can fail, using shelves can be arbitrarily bad, but unrestricted list scheduling remains a 2-approximation. The paper focuses on the design of several heuristics, some list-based and some shelf-based, along with different priority rules and backfilling strategies. We assess and compare their performance through an extensive set of simulations using both synthetic jobs and log traces from the Mira supercomputer.
Fichier principal
Vignette du fichier
rigid_ijnc.pdf (835.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03508937 , version 1 (03-01-2022)

Identifiers

Cite

Anne Benoit, Valentin Le Fèvre, Padma Raghavan, Yves Robert, Hongyang Sun. Resilient Scheduling Heuristics for Rigid Parallel Jobs. International Journal of Networking and Computing, 2021, 11 (1), pp.1-25. ⟨10.15803/ijnc.11.1_2⟩. ⟨hal-03508937⟩
46 View
92 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More