Parallel Algorithms for Terminal-Pair Reliability

IEEE Transactions on Reliability

Volumn 41, Issue 2, 1992, Pages 201-209

  Deo, Narsingh ^a   Medidi, Muralidhar ^a  

^a UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

Digraph; Directed network; Factoring; Graph; Network reduction; Parallel algorithm; Parallel processing; Partitioning; Speedup; Terminal pair reliability

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

BBN BUTTERFLY PARALLEL COMPUTER; REDUCE-AND-PARTITION SEQUENTIAL ALGORITHM; SHARED-MEMORY PARALLEL COMPUTER; TERMINAL-PAIR RELIABILITY;

RELIABILITY;

EID: 0026882380     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.257782     Document Type: Article

References (21)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, Data Structures and Algorithms, 1983; Addison-Wesley.
2. M.P. Bailey, V.G. Kulkarni, “A recursive algorithm for computing exact reliability measures,” IEEE Trans. Reliability, vol R-35, 1986 Apr, pp. 36–40.
3. M.O. Ball, E.P. Cameron, “Experiments with network reliability analysis algorithms,” Modelling and Simulation: Proc. 17th Ann. Pittsburgh Conf., (Vogt & Mickle, eds), vol 17, 1986, pp. 1799–1803.
4. J.A. Buzacott, “A recursive algorithm for finding reliability measures related to the connection of nodes in a graph,” Networks, vol 10, 1980, pp. 311–327.
5. W.H. Debany Jr., P.K. Varshney, C.R.P. Hartmann, “Network reliability evaluation using probability expressions,” IEEE Trans. Reliability, vol R-35, 1986 Jun, pp. 161–166.
6. N. Deo, Graph Theory with Applications to Engineering and Computer Science, 1974; Prentice-Hall.
7. W.P. Dotson, J.O. Gobein, “A new analysis technique for probabilistic graphs,” IEEE Trans. Circuits & Systems, vol 26, 1979, pp. 855–865.
8. L. Fratta, U.G. Montanari, “A Boolean algebra method for computing the terminal reliability in a communication network,” IEEE Trans. Circuit Theory, vol CT-20, 1973, pp. 203–211.
9. L. Fratta, U.G. Montanari, “A recursive method based on case analysis for computing network terminal reliability,” IEEE Trans. Communication, vol Com-26, 1978, pp. 1166–1177.
10. E. Horowitz, S. Sahni, Fundamentals of Data Structures in Pascal, 1990, pp. 348–350; Computer Science Press.
11. A.R. Larrabee, K.E. Pennick, S.M. Stern, “BBN Butterfly parallel processor,” Programming Parallel Processors, (Robert G. Babbll, ed), 1988, pp. 43–57; Addison-Wesley.
12. P.M. Lin, B.J. Leon, T. Ch. Huang, “A new algorithm for symbolic system reliability analysis,” IEEE Trans. Reliability, vol R-25, 1976 Apr, pp. 2–15.
13. A.C. Nelson Jr., J.R. Batts, R.L. Beadles, “A computer program for approximating system reliability,” IEEE Trans. Reliability, vol R-19, 1970 Feb, pp. 61–65.
14. L.B. Page, J.E. Perry, “A practical implementation of the factoring theorem for network reliability,” IEEE Trans. Reliability, vol 37, 1988 Aug, pp. 259–267.
15. L.B. Page, J.E. Perry, “Reliability of directed networks using the factoring theorem,” IEEE Trans. Reliability, vol 38, 1989 Dec, pp. 556–562.
16. J.S. Provan, M.O. Ball, “Computing network reliability in time polynomial in the number of cuts,” Operations Research, vol 32, 1984, pp. 516–526.
17. J.S. Provan, M.O. Ball, “The complexity of counting cuts and of computing the probability that a graph is connected,” SI AM J. Computing, vol 12, 1983 Nov, pp. 777–788.
18. A. Satyanarayana, M.K. Chang “Network reliability analysis and the factoring theorem,” Networks, vol 13, 1983, pp. 107–120.
19. M.L. Shooman, Probabilistic Reliability: An Engineering Approach, 1968; McGraw-Hill.
20. R.K. Wood, “Factoring algorithms for computing K-terminal network reliability,” IEEE Trans. Reliability, vol R-35, 1986 Aug, pp. 269–278.
21. Y.B. Yoo, N. Deo, “A comparison of algorithms for terminal-pair reliability,” IEEE Trans. Reliability, vol 37, 1988 Jun, pp. 210–215.