Skip to Main content Skip to Navigation
Conference papers

A Generic Approach to Scheduling and Checkpointing Workflows

Abstract : This work deals with scheduling and checkpointing strategies to execute scientific workflows on failure-prone large-scale platforms. To the best of our knowledge, this work is the first to target fail-stop errors for arbitrary workflows. Most previous work addresses soft errors, which corrupt the task being executed by a processor but do not cause the entire memory of that processor to be lost, contrarily to fail-stop errors. We revisit classical mapping heuristics such as HEFT and MINMIN and complement them with several checkpointing strategies. The objective is to derive an efficient trade-off between checkpointing every task (CKPTALL), which is an overkill when failures are rare events, and checkpointing no task (CKPTNONE), which induces dramatic re-execution overhead even when only a few failures strike during execution. Contrarily to previous work, our approach applies to arbitrary workflows, not just special classes of dependence graphs such as M-SPGs (Minimal Series-Parallel Graphs). Extensive experiments report significant gain over both CKPTALL and CKPTNONE, for a wide variety of workflows.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01798627
Contributor : Equipe Roma <>
Submitted on : Wednesday, May 23, 2018 - 4:35:37 PM
Last modification on : Monday, November 16, 2020 - 9:56:04 AM
Long-term archiving on: : Friday, August 24, 2018 - 9:37:45 PM

File

icpp.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01798627, version 1

Citation

Li Han, Valentin Le Fèvre, Louis-Claude Canon, Yves Robert, Frédéric Vivien. A Generic Approach to Scheduling and Checkpointing Workflows. ICPP 2018: 47th International Conference on Parallel Processing, Aug 2018, Eugene, OR, United States. pp.1-10. ⟨hal-01798627v1⟩

Share

Metrics

Record views

43

Files downloads

17