Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms

This paper deals with the reliability of task graph schedules 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. We fill a complexity gap of the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of scheduling Jg. 15; H. 5; S. 615 - 627
Hauptverfasser: Benoit, Anne, Canon, Louis-Claude, Jeannot, Emmanuel, Robert, Yves
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Boston Springer US 01.10.2012
Springer Science + Business Media
Springer Nature B.V
Springer Verlag
Schlagworte:
Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Complexity
Computer Science
Distributed, Parallel, and Cluster Computing
Failure
Graphs
Operations Research/Decision Theory
Optimization
Reliability
Replication
Schedules
Scheduling
Studies
Supply Chain Management
Tasks
Complexity results
Algorithms
Reliability
Task graph schedules
Fail-stop and transient failures
ISSN:1094-6136, 1099-1425
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper deals with the reliability of task graph schedules 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. We fill a complexity gap of the scheduling literature: our main result is that this reliability problem is # P ′-Complete (hence at least as hard as NP-Complete problems), both for transient and for fail-stop processor failures. We also study the evaluation of a restricted class of schedules, where a task cannot be scheduled before all replicas of all its predecessors have completed their execution. Although the complexity in this case with fail-stop failures remains open, we provide an algorithm to estimate the reliability while limiting evaluation costs, and we validate this approach through simulations.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-011-0236-y