On the complexity of task graph scheduling with transient and fail-stop failures

Anne Benoit 1, 2 Louis-Claude Canon 3 Emmanuel Jeannot 3 Yves Robert 1, 2
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 RUNTIME - Efficient runtime systems for parallel architectures
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : This paper deals with the complexity of task graph scheduling with transient and fail-stop failures. While computing the reliability of a given schedule is easy in the absence of task replication, the problem becomes much more difficult when task replication is used. Our main result is that this problem is #P'- Complete (hence at least as hard as NP-Complete problems), with both transient and fails-stop processor failures. We also study the complexity of a restricted class of schedules, where a task cannot be scheduled before all replicas of all its predecessors have completed their execution.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00457511
Contributor : Anne Benoit <>
Submitted on : Wednesday, February 17, 2010 - 3:16:47 PM
Last modification on : Thursday, May 16, 2019 - 6:46:08 PM
Long-term archiving on : Thursday, October 18, 2012 - 3:15:34 PM

File

rr-lip-2010-01.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00457511, version 1

Citation

Anne Benoit, Louis-Claude Canon, Emmanuel Jeannot, Yves Robert. On the complexity of task graph scheduling with transient and fail-stop failures. 2010. ⟨hal-00457511⟩

Share

Metrics

Record views

929

Files downloads

234