Distributed program reliability analysis
IEEE Transactions on Software Engineering
Reliability Analysis in Distributed Systems
IEEE Transactions on Computers
Management of Value-Added Services in theTrading-Based System AGORA
Journal of Network and Systems Management
Reliability of grid service systems
Computers and Industrial Engineering
Optimal task partition and distribution in grid service system with common cause failures
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
A Hierarchical Modeling and Analysis for Grid Service Reliability
IEEE Transactions on Computers
Monte Carlo simulation-based algorithms for estimating the reliability of mobile agent-based systems
Journal of Network and Computer Applications
Reliability of grid service systems
Computers and Industrial Engineering
A probability model for reconstructing secret sharing under the internet environment
Information Sciences: an International Journal
A fast algorithm for reliability-oriented task assignment in a distributed system
Computer Communications
Reliability analysis of a simple replicated and-fork/and-join graph
Operations Research Letters
| Hi-index | 0.00 |
The reliability of a distributed processing system (DPS) can be expressed by the analysis of distributed program reliability (DPR) and distributed system reliability (DSR). One of the good approaches to formulate these reliability performance indexes is to generate all disjoint file spanning trees (FSTs) in the DPS graph such that the DPR and DSR can be expressed by the probability that at least one of these FSTs is working. In the paper, a unified algorithm to efficiently generate disjoint FSTs by cutting different links is presented, and the DPR and DSR are computed based on a simple and consistent union operation on the probability space of the FSTs. The DPS reliability related problems are also discussed. For speeding up the reliability evaluation, nodes merged, series, and parallel reduction concepts are incorporated in the algorithm. Based on the comparison of number of subgraphs (or FSTs) generated by the proposed algorithm and by existing evaluation algorithms, it is concluded that the proposed algorithm is much more economic in terms of time and space than the existing algorithms.