On the complexity of task graph scheduling with transient and fail-stop failures - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2010

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

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.
Fichier principal
Vignette du fichier
rr-lip-2010-01.pdf (162.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00457511 , version 1 (17-02-2010)

Identifiers

  • HAL Id : hal-00457511 , version 1

Cite

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⟩
672 View
151 Download

Share

Gmail Facebook X LinkedIn More