Reliability analysis of a simple replicated and-fork/and-join graph

Authors:
De-Ron Liang;Rong-Hong Jan
Affiliations:
Institute of Information Science, Academia Sinica, Taipei, 11529, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, Hsinchu, 30050, Taiwan, ROC
Venue:
Operations Research Letters
Year:
1994

Citing 6
Cited 1

Performance and Reliability Analysis Using Directed Acyclic Graphs

IEEE Transactions on Software Engineering
Linear time algorithms for NP-hard problems restricted to partial k-trees

Discrete Applied Mathematics
The Combinatorics of Network Reliability

The Combinatorics of Network Reliability
Predicting Performance of Parallel Computations

IEEE Transactions on Parallel and Distributed Systems
Reliability Analysis of Distributed Systems Based on a Fast Reliability Algorithm

IEEE Transactions on Parallel and Distributed Systems
The N-Version Approach to Fault-Tolerant Software

IEEE Transactions on Software Engineering

Efficient algorithms for the reliabilities of replicated n-parallel-task graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of calculating the reliability of the replicated and-fork/and-join (RAFAJ) task graphs. An RAFAJ task graph is generated from an AFAJ task graph with vertex and arc replications. Due to the AFAJ constraint, the task graphs considered in our problem are more general than those considered in the network reliability problem, which is an NP-complete problem for general task graphs. In this paper, we propose an algorithm with time complexity O(n . 2^2^r); where n is number of concurrent tasks, and r is the number of replications.