A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems

DOI10.1016/S0898-1221(97)00210-1zbMath0903.68010OpenAlexW2074761435MaRDI QIDQ1130399

Tien-Hsiang Huang, Ruey-Shun Chen, Deng-Jyi Chen

Publication date: 20 August 1998

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00210-1

zbMATH Keywords

reliabilitydistributed program reliabilitydistributed computing systemsdistributed system reliability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Performance assessment and reliability analysis of dependable and distributed computing systems based on BDD and recursive merge ⋮ A genetic algorithm for reliability-oriented task assignment in a distributed system ⋮ Reliability Evaluation in Grid Environment

Cites Work

• Distributed program reliability analysis
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Computational Complexity of Network Reliability Analysis: An Overview
• Factoring Algorithms for Computing K-Terminal Network Reliability

This page was built for publication: A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems