Efficient algorithms for the reliabilities of replicated n-parallel-task graphs

DOI10.1016/0167-6377(96)00026-0zbMATH Open0873.90039OpenAlexW2069546543MaRDI QIDQ1360110FDOQ1360110

Authors: Frank K. Hwang, Paul Wright 

Publication date: 15 July 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(96)00026-0

Recommendations

• scientific article; zbMATH DE number 1045599
• Reliability analysis of a simple replicated and-fork/and-join graph
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks

zbMATH Keywords

fault-tolerancefork-join networks\(n\)-parallel-task graphreplicated task systems

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Communication networks in operations research (90B18)

Cites Work

• Generalization of an engineering principle
• Reliability analysis of a simple replicated and-fork/and-join graph
• Assembly at system level versus component level

Cited In (4)

• Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems.
• Optimal replication of series-parallel graphs for computation-intensive applications
• Reliability analysis of a simple replicated and-fork/and-join graph
• Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms

This page was built for publication: Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs

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