Distributed program reliability analysis
IEEE Transactions on Software Engineering
The complexity of reliability computations in planar and acyclic graphs
SIAM Journal on Computing
SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods
IEEE Transactions on Computers
Performance and Reliability Analysis Using Directed Acyclic Graphs
IEEE Transactions on Software Engineering
Survey of software tools for evaluating reliability, availability, and serviceability
ACM Computing Surveys (CSUR)
Performance of the Direct Binary n-Cube Network for Multiprocessors
IEEE Transactions on Computers
Multistage Interconnection Network Reliability
IEEE Transactions on Computers
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Distributed Computing Network Reliability
Distributed Computing Network Reliability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Evaluating FTRE's for Dependability Measures in Fault Tolerant Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Processor Allocation in Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Tighter Bounds on Full Access Probability in Fault-Tolerant Multistage Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Improved Lower Bounds on the Reliability of Hypercube Architectures
IEEE Transactions on Parallel and Distributed Systems
SAFECOMP '02 Proceedings of the 21st International Conference on Computer Safety, Reliability and Security
An Improved Multiple Variable Inversion Algorithm for Reliability Calculation
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Implementing integrated services of networked home appliances using service oriented architecture
Proceedings of the 2nd international conference on Service oriented computing
Computers and Operations Research
A memory efficient algorithm for network reliability
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
A set theory based method to derive network reliability expressions of complex system topologies
ACC'10 Proceedings of the 2010 international conference on Applied computing conference
Performance evaluation for a transportation system in stochastic case
Computers and Operations Research
| Hi-index | 0.01 |
An efficient method to compute the terminal reliability (the probability of communication between a pair of nodes) of a distributed computing system (DCS) is presented. It is assumed that the graph model G(V,E) for DCS is given and that the path and/or cut information for the network G(V,E) is available. Boolean algebraic concepts are used to define four operators: compare, reduce, combine, and generate. The proposed method, called CAREL, uses the four operators to generate exclusive and mutually disjoint events. CAREL has been implemented using bit vector representation on an Encore MULTIMAX 320 system. It is shown that CAREL solves large DCS networks (having a pathset on the order of 780 and a cutset on the order of 7300 or more) with a reasonable memory requirement. A comparison with other algorithms reveals the computational efficiency of the method. The proof of correctness of CAREL is included.