Scheduling Computational Workflows on Failure-Prone Platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Scheduling Computational Workflows on Failure-Prone Platforms


We study the scheduling of computational workflows on compute resources that experience exponentially distributed failures. When a failure occurs, roll-back and recovery is used to resume the execution from the last checkpointed state. The scheduling problem is to minimize the expected execution time by deciding in which order to execute the tasks in the workflow and whether to checkpoint or not checkpoint a task after it completes. We give a polynomial-time algorithm for fork graphs and show that the problem is NP-complete with join graphs. Our main result is a polynomial-time algorithm to compute the execution time of a workflow with specified to-be-checkpointed tasks. Using this algorithm as a basis, we propose efficient heuristics for solving the scheduling problem. We evaluate these heuristics for representative workflow configurations.
Fichier principal
Vignette du fichier
apdcm.pdf (288.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01251939 , version 1 (07-01-2016)



Guillaume Aupy, Anne Benoit, Henri Casanova, Yves Robert. Scheduling Computational Workflows on Failure-Prone Platforms. 17th Workshop on Advances in Parallel and Distributed Computational Models, May 2015, Hyderabad, India. ⟨10.1109/IPDPSW.2015.33⟩. ⟨hal-01251939⟩
263 View
164 Download



Gmail Facebook X LinkedIn More