scientific article; zbMATH DE number 1045599

DOI10.1002/(SICI)1097-0037(199707)29:4%3C195::AID-NET2%3E3.0.CO;2-AMaRDI QIDQ4347272zbMATH OpenFDO

Authors De-Ron Liang, Rong-Hong Jan, Satish K. Tripathi

Publication date 10 March 1998

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199707)29:4%3C195::AID-NET2%3E3.0.CO;2-A

zbMATH Keywords

computation taskdistributed systemsdistributed task reliability

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs
• Reliability analysis of a simple replicated and-fork/and-join graph
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks

Cited in

(7)

• Reliability analysis of a simple replicated and-fork/and-join graph
• Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs
• Reliability analysis of godan graphs
• Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms
• Computing reliability intervals for k-resilient protocols
• scientific article; zbMATH DE number 1501630 (Why is no real title available?)
• Network reliability: Heading out on the highway

This page was built for publication:

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