This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improved Lower Bounds on the Reliability of Hypercube Architectures
April 1994 (vol. 5 no. 4)
pp. 364-378

The hypercube topology, also known as the Boolean n-cube, has recently been used for multiprocessing systems. The paper considers two structural-reliability models, namely, terminal reliability (TR) and network reliability (NR), for the hypercube. Terminal (network) reliability is defined as the probability that there exists a working path connecting two (all) nodes. There are no known polynomial time algorithms for exact computation of TR or NR for the hypercube. Thus, lower-bound computation is a better alternative, because it is more efficient computationally, and the system will be at least as reliable as the bound. The paper presents algorithms to compute lower bounds on TR and NR for the hypercube considering node and/or link failures. These algorithms provide tighter bounds for both TR and NR than known results and run in time polynomial in the cube dimension n, specifically, within time O(n/sup 2/).

[1] S. Abraham and K. Padmanabhan, "Reliability of the hypercube,"1988 Int. Conf. Parallel Processing, 1988, pp. 90-94.
[2] R. M. Ahmed and J. L. Trahan, "Two-terminal reliability of hypercubes,"Proc. Southeastcon'91, 1991, pp. 427-431.
[3] J. R. Armstrong and F. G. Gray, "Fault diagnosis in a Boolean n-cube array of multiprocessors,"IEEE Trans. Comput., vol. 30, no. 8, pp. 587-590, Aug. 1981.
[4] M. O. Ball and J. S. Provan, "Disjoint products and efficient computation of reliability,"Operations Res., vol. 36, pp. 703-715, 1988.
[5] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. 33, no. 4, pp. 323-333, Apr. 1984.
[6] D. Bulka and J. B. Dugan, "A lower bound on the reliability of an n-dimensional hypercube,"Proc. 9th Symp. Reliable Distrib. Syst., 1990, pp. 44-53.
[7] C. J. Colbourn,The Combinatorics of Network Reliability. Oxford, U.K.: Oxford University Press, 1987.
[8] C. R. Das and J. Kim, "A unified task-based dependability model for hypercube computers,"IEEE Trans. Parallel Distrib. Syst., vol. 3, pp. 312-324, May 1992.
[9] A. El-Amawy and S. Latifi, "Properties and performance of folded hypercubes,"IEEE Trans. Parallel Distrib. Syst., vol. 2, pp. 31-42, Jan. 1991.
[10] A. Esfahanian, "Generalized measures of fault tolerance with application ton-cube networks,"IEEE Trans. Comput., vol. 38, pp. 1586-1591, Nov. 1989.
[11] 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.
[12] F. Harary, J. P. Hayes, and H. Wu, "A survey of the theory of hypercube graphs,"Comput. Math. Applic., vol. 15, pp. 277-289, 1988.
[13] J.P. Hayes and T.N. Mudge, "Hypercube Supercomputers,"Proc. IEEE, Vol. 77, No. 12, Dec. 1989, pp. 1,829-1,841.
[14] J. Kim, C. R. Das, W. Lin, and T. Y. Feng, "Reliability evaluation of hypercube multicomputers,"IEEE Trans. Reliability, Special Issue on Reliability of Parallel and Distributed Computing Networks, pp. 121-129. Apr. 1989.
[15] D. Y. Koo, "D/Boolean application in reliability analysis," inProc. Annu. Reliability Maintainability Symp., 1990, pp. 294-301.
[16] F. T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes. Palo Alto, CA: Morgan Kaufmann, 1992.
[17] W. Najjar and J. L. Gaudiot, "Reliability and performance modeling of hypercube-based multiprocessors," inComputer Performance and Reliability, G. Iazeolla et al., Eds. Amsterdam: North-Holland, 1988, pp. 305-320.
[18] W. Najjar and J. L. Gaudiot, "Network resilience: A measure of network fault tolerance,"IEEE Trans. Comput., vol. 39, pp. 174-181, Feb. 1990.
[19] Rai, S., and D.P. Agrawal,Advances in Distributed System Reliability, IEEE Computer Society Press, Los Alamitos, Calif., Order No. 1907, 1990.
[20] D. A. Reed and R. M. Fujimoto,Multicomputer Networks, Message-Based Parallel Processing. Cambridge, MA: MIT Press, 1987.
[21] Y. Saad and M. H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, pp. 867-872, July 1988.
[22] D.P. Siewiorek and R.W. Swarz,Reliable Computer Systems: Design and Evaluation, Digital Press, Bedford, Mass., 1992.
[23] S. Soh and S. Rai, "CAREL: Computer aided reliability evaluator for distributed computer systems,"IEEE Trans. Parallel Distrib. Syst., vol. 2, pp. 199-213, Apr. 1991.
[24] S. Soh and S. Rai, "Experimental results on preprocessing of path / cut terms in sum of disjoint products technique,"IEEE Trans. Reliability, vol. 42, pp. 24-33, Mar. 1993.
[25] J. L. Trahan, D. X. Wang, and S. Rai, "Incorporating dependent and multimode failures into reliability evaluation of extra stage shuffleexchange MIN's,"Proc. 30th Allerton Conf. Commun., Control and Computing, 1992, pp. 884-892.
[26] M. Veeraraghavan and K. S. Trivedi, "An improved algorithm for symbolic reliability analysis,"IEEE Trans. Reliability, vol 40, Aug. 1991, pp. 347-358.
[27] M. Veeraraghavan and K.S. Trivedi, "Techniques for two-terminal network reliability evaluation," private communication.
[28] C. Yang, J. Wang, J. Lee, and F. Boesch, "Graph theoretic reliability analysis for the Booleann-cube networks,"IEEE Trans. Circuits Syst., vol. 32, no. 9, pp. 1175-1179, 1988.

Index Terms:
Index Termshypercube networks; parallel architectures; fault tolerant computing; reliability; computational complexity; hypercube topology; Boolean n-cube; lower bounds; reliability; terminal reliability; network reliability; structural-reliability models; hypercube; tighter bounds; time O(n/sup 2/); hypercube architecture; node failure; path generation; reliability bounds; spanning trees
Citation:
S. Soh, S. Rai, J.L. Trahan, "Improved Lower Bounds on the Reliability of Hypercube Architectures," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 4, pp. 364-378, April 1994, doi:10.1109/71.273045
Usage of this product signifies your acceptance of the Terms of Use.