A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems
- 1 November 1997
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 34 (10) , 115-131
- https://doi.org/10.1016/s0898-1221(97)00210-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- General Reduction Methods for the Reliability Analysis of Distributed Computing SystemsThe Computer Journal, 1993
- Reliability analysis of distributed systems based on a fast reliability algorithmIEEE Transactions on Parallel and Distributed Systems, 1992
- Reliability analysis in distributed systemsIEEE Transactions on Computers, 1988
- On computer communication network reliability under program execution constraintsIEEE Journal on Selected Areas in Communications, 1988
- Factoring Algorithms for Computing K-Terminal Network ReliabilityIEEE Transactions on Reliability, 1986
- Distributed program reliability analysisIEEE Transactions on Software Engineering, 1986
- Computational Complexity of Network Reliability Analysis: An OverviewIEEE Transactions on Reliability, 1986
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel NetworksSIAM Journal on Computing, 1985