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.
Type de document :
[Research Report] RR-7907, INRIA. 2012
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger

Contributeur : Frédéric Vivien <>
Soumis le : lundi 19 mars 2012 - 13:18:41
Dernière modification le : vendredi 20 avril 2018 - 15:44:27
Document(s) archivé(s) le : mercredi 14 décembre 2016 - 17:54:19


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00680386, version 1



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〉



Consultations de la notice


Téléchargements de fichiers