|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| S. Soh, S. Rai, "CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 2, pp. 199-213, April, 1991. | |||
| BibTex | x | ||
| @article{ 10.1109/71.89065, author = {S. Soh and S. Rai}, title = {CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {2}, number = {2}, issn = {1045-9219}, year = {1991}, pages = {199-213}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.89065}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks IS - 2 SN - 1045-9219 SP199 EP213 EPD - 199-213 A1 - S. Soh, A1 - S. Rai, PY - 1991 KW - Index TermsCAREL; reliability evaluator; distributed computing networks; terminal reliability;distributed computing system; graph model; Encore MULTIMAX; computer aided analysis; computer testing; distributed processing; performance evaluation VL - 2 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
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.
[1] S. Hariri and C.S. Raghavendra, "SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods,"IEEE Trans. Computers, Vol. C-36, No. 10, Oct. 1987, pp. 1,224-1,232.
[2] S. Rai and D. P. Agrawal,Distributed Computing Network Reliability. Los Alamitos, CA: IEEE Computer Society Press, 1990.
[3] A. Grnarov, L. Kleinrock, and M. Gerla, "A new algorithm for network reliability computation," inProc. Computer Networking Symp., Dec. 1979, pp. 17-20.
[4] A.M. Johnson and M. Malek, "Survey of Software Tools for Evaluating Reliability, Availability, and Serviceability,"ACM Computing Surveys, Vol. 20, No. 4, Dec. 1988, pp. 227-269.
[5] D. Y. Koo, "D/Boolean application in reliability analysis," inProc. Annu. Reliability Maintainability Symp., 1990, pp. 294-301.
[6] V. Kini and D. P. Siewiorek, "Automatic generation of symbolic reliability functions for processor memory switch structure,"IEEE Trans. Comput., vol. C-31, pp. 752-771, Aug. 1982.
[7] C. C. Fong and J. A. Buzacott, "Au algorithm of symbolic reliability computation with pathsets-or cutsets,"IEEE Trans. Reliability, vol. R-36, pp. 34-37, Apr. 1987.
[8] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[9] C. J. Colbourn,The Combinatorics of Network Reliability. Oxford, U.K.: Oxford University Press, 1987.
[10] R. G. Bennetts, "Analysis of reliability block diagrams by Boolean techniques,"IEEE Trans. Reliability, vol. R-31, pp. 159-166, June 1982.
[11] A. Rosenthal, "Approaches to comparing cut-set enumeration algorithms,"IEEE Trans. Reliability, vol. R-28, pp. 62-65, Apr. 1979.
[12] S. Rai and K.K. Aggarwal, "An efficient method for reliability evaluation of a general network,"IEEE Trans. Reliability, vol. R-27, pp. 206-211, Aug. 1978.
[13] J. A. Abraham, "An improved algorithm for network reliability,"IEEE Trans. Reliability, vol. R-28, pp. 58-61, Apr. 1979.
[14] L. Fratta and U. G. Montanari, "A recursive method based on case analysis for computing network terminal reliability,"IEEE Trans. Commun., pp. 1166-1177, Aug. 1978.
[15] M.O. Locks, "A minimizing algorithm for the sum of disjoint products,"IEEE Trans. Reliability, vol. R-36, pp. 445-453, Oct. 1987.
[16] X. Qian, N. Shiratori, and S. Noguchi, "An algorithm for evaluating K-terminal reliability," private communication.
[17] R. A. Sahner and K. S. Trivedi, "Performance and reliability analysis using directed acyclic graphs,"IEEE Trans. Software Eng., vol. SE-13, pp. 1105-1114, Oct. 1987.
[18] M. Veeraraghavan and K.S. Trivedi, "An improved algorithm for the symbolic reliability analysis of networks," inProc. Ninth Symp. Reliable Distributed Syst., Huntsville, AL, Oct. 1990, pp. 34-43.
[19] S. Rai and J. Trahan, "Computing network reliability of redundant MIN's," inProc. 21st Southeastern Symp. Syst. Theory, Tallahassee, FL, Mar. 1989, pp. 221-225.
[20] R. Miller,Switching Theory, Vol. 1 : Combinational Circuits.New York: Wiley, 1965.
[21] V. K. Prasanna Kumar, S. Hariri, and C. S. Raghavendra, "Distributed program reliability analysis,"IEEE Trans. Software Eng., pp. 42-50, Jan. 1986.
[22] R. K. Tiwari and M. Verma, "An algebraic technique for reliability evaluation,"IEEE Trans. Reliability, vol. R-29, pp. 311-313, Oct. 1980.
[23] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[24] R. Johnson, "Network reliability and acyclic orientations,"Networks, vol. 14, pp. 489-505, 1984.
[25] Y. B. Yoo and N. Deo, "A comparison of algorithms for terminal pair reliability,"IEEE Trans. Reliability, vol. R-37, pp. 210-215, June 1988.
[26] J. S. Provan and M. Ball, "Computing network reliability in time polynomial in the number of cuts,"Oper. Res., vol. 32, pp. 516-526, 1984.
[27] S. Y. Kuo and W. K. Fuchs, "Spare allocation and reconfiguration in large area VLSI," inProc. 25th ACM/IEEE Design Automat. Conf., 1988, pp. 609-612.
[28] S. Abraham and K. Padmanabhan, "Reliability of the hypercube," inProc. Int. Conf. Parallel Processing, 1988, pp. 90-94.
[29] S. Abraham and K. Padmanabhan, "Performance of the direct binaryn-cube network for multiprocessors,"IEEE Trans. Comput., vol. 38, pp. 1000-1011, July 1989.
[30] J. T. Blake and K. S. Trivedi, "Multistage interconnection network reliability,"IEEE Trans. Comput., vol. 38, pp. 1600-1604, Nov. 1989.