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

DOI10.1007/S10951-011-0236-YMaRDI QIDQ2434302zbMATH OpenOpenAlexFDO

Authors Anne Benoit, Louis-Claude Canon, Emmanuel Jeannot, 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

algorithmscomplexity resultsfail-stop and transient failuresreliabilitytask graph schedules

Mathematics Subject Classification ID

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

Recommendations

• Reliability analysis of a simple replicated and-fork/and-join graph
• Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs
• Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics
• Approximation algorithms for energy, reliability, and makespan optimization problems
• scientific article; zbMATH DE number 1045599

Cites work

• scientific article; zbMATH DE number 1256771 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• 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

Cited in

(2)

• Reliability analysis of a simple replicated and-fork/and-join graph
• Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434302)