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

DOI10.1007/S10951-011-0236-YzbMath1280.90026OpenAlexW2102444983MaRDI QIDQ2434302

Emmanuel Jeannot, Anne Benoit, Louis-Claude Canon, Yves Robert

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-011-0236-y

zbMATH Keywords

algorithmsreliabilitycomplexity resultsfail-stop and transient failurestask graph schedules

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Reliability, availability, maintenance, inspection in operations research (90B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics
• Task allocation in fault-tolerant distributed systems
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Enumeration and Reliability Problems
• Tolerance and Confidence Limits for Classes of Distributions Based on Failure Rate

This page was built for publication: Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms