Skip to Main content Skip to Navigation
Conference papers

Scheduling Computational Workflows on Failure-Prone Platforms

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01251939
Contributor : Equipe Roma <>
Submitted on : Thursday, January 7, 2016 - 4:18:25 AM
Last modification on : Wednesday, February 26, 2020 - 11:14:31 AM
Long-term archiving on: : Friday, April 8, 2016 - 1:08:32 PM

File

apdcm.pdf
Files produced by the author(s)

Identifiers

Collections

Relations

Citation

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⟩

Share

Metrics

Record views

464

Files downloads

624