Skip to Main content Skip to Navigation
Reports

On the complexity of scheduling checkpoints for computational workflows

Abstract : This paper deals with the complexity of scheduling computational workflows in the presence of Exponential failures. When such a failure occurs, rollback and recovery is used so that the execution can resume from the last checkpointed state. The goal is to minimize the expected execution time, and we have to decide in which order to execute the tasks, and whether to checkpoint or not after the completion of each given task. We show that this scheduling problem is strongly NP-complete, and propose a (polynomial-time) dynamic programming algorithm for the case where the application graph is a linear chain. These results lay the theoretical foundations of the problem, and constitute a prerequisite before discussing scheduling strategies for arbitrary DAGS of moldable tasks subject to general failure distributions.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-00680386
Contributor : Frédéric Vivien <>
Submitted on : Monday, March 19, 2012 - 1:18:41 PM
Last modification on : Monday, November 16, 2020 - 9:56:03 AM
Long-term archiving on: : Wednesday, December 14, 2016 - 5:54:19 PM

File

RR-7907.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00680386, version 1

Collections

Citation

Yves Robert, Frédéric Vivien, Dounia Zaidouni. On the complexity of scheduling checkpoints for computational workflows. [Research Report] RR-7907, INRIA. 2012. ⟨hal-00680386⟩

Share

Metrics

Record views

413

Files downloads

448