
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Lagman, W.A. Najjar, P.K. Srimani, "An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks," IEEE Transactions on Computers, vol. 43, no. 4, pp. 470475, April, 1994.  
BibTex  x  
@article{ 10.1109/12.278484, author = {A. Lagman and W.A. Najjar and P.K. Srimani}, title = {An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {4}, issn = {00189340}, year = {1994}, pages = {470475}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.278484}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks IS  4 SN  00189340 SP470 EP475 EPD  470475 A1  A. Lagman, A1  W.A. Najjar, A1  P.K. Srimani, PY  1994 KW  multiprocessor interconnection networks; network topology; fault tolerant computing; edge fault tolerance; recursively decomposable; regular networks; interconnection networks; reliability; large scale multiprocessor; edge failures; fault tolerance measures; probabilistic measures; resilience; restricted resilience; network topologies; probabilistic fault tolerance measures; topological properties. VL  43 JA  IEEE Transactions on Computers ER   
Fault tolerance of interconnection networks is one of the major considerations in evaluating the reliability of large scale multiprocessor systems. In the paper, the reliability of a family of regular networks with respect to edge failures is investigated using four different fault tolerance measures. Two probabilistic measures, resilience and restricted resilience, are developed, used to evaluate disconnection likelihoods using two different failure models, and compared with corresponding deterministic measures. The network topologies chosen for the present study all have the recursive decomposition property, where larger networks can be decomposed into copies of smaller networks of the same topology. This family of graphs includes the kary ncube, star and cube connected cycle graphs, which have optimal deterministic connectivities. The probabilistic fault tolerance measures, however, are found to depend on topological properties such as network size and degree.
[1] J. G. Kuhl and S. M. Reddy, "Faulttolerance considerations in large, multipleprocessor systems,"IEEE Computer, vol. 19, no. 3, pp. 5667, Mar. 1986.
[2] L. N. Bhuyan, "Interconnection networks for parallel and distributed processing,"IEEE Comput. Mag., pp. 912, June 1987. Guest Editor's Introduction.
[3] G. B. Adams, D. P. Agrawal, and H. J. Siegel, "A survey and comparison of faulttolerant multistage interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 1427, June 1987.
[4] D. Pradhan, "Faulttolerant multiprocessor link and bus network architectures,"IEEE Trans. Comput., vol. C34, pp. 3345, Jan. 1985.
[5] M.S. Chen and K. Shin, "Faulttolerant routing in hypercube multicomputers using depthfirst search," Berkeley,Int. Computer Sci. Inst. Tech. ReportTR89006, 1989.
[6] T. Chen and T. Kang, "The connectivity of hypergraph and the design of faulttolerant multibus systems,"Proc. 1988 Symp. FaultTolerant Computing, 1988, pp. 374379.
[7] B. E. Aupperle and J. F. Meyer, "Faulttolerant BIBD networks,"Proc. 1988 Symp. FaultTolerant Computing, 1988, pp. 306311.
[8] J. Blake and K. S. Trivedi, "Reliabilities of two faulttolerant interconnection networks,"Proc. 1988 Symp. FaultTolerant Computing, 1988, pp. 300305.
[9] A. Ghafoor, T. R. Bashkow, and I. Ghafoor, "An interconnection topology for faulttolerant multiprocessor systems,"Proc. 1987 Conf. Distributed Computing Systems, pp. 120127.
[10] W.T. Chen and J.P. Sheu, "Faulttolerant twolevel multistage interconnection networks,"Proc. 1987 Conf. Distributed Computing Systems, pp. 136143.
[11] S. Dutt and J. P. Hayes, "Design and reconfiguration strategies for nearoptimal faulttolerant tree architectures," inProc. Eighteenth Fault Tolerant Comput. Symp., June 1988, pp. 328333.
[12] N.F. Tzeng, "Structural properties of incomplete hypercube computers," inProc. 10th IEEE Int. Conf. Distrib. Computing Syst., May 1990, pp. 262269.
[13] S. B. Akers and B. Krishnamurthy, "Group graphs as interconnection networks,"Proc. 14th Int. Conf. Fault Tolerant Computing, 1984, pp. 422427.
[14] Z. Liu, "Optimal routing in the De Bruijn networks,"Proc. 1990 Conf. Distributed Computing Systems, pp. 537544.
[15] F. Harary, "Conditional connectivity,"Networks, vol. 13, 1983.
[16] F. Harary, "General connectivity,"Lecture Notes in Mathematics, SpringerVerlag, 1984, vol. 1073.
[17] M. Tainiter, "Statistical theory of connectivity: basic definitions and properties,"Discrete Mathemat., vol. 13, 1975.
[18] M. Tainiter, "A new deterministic network reliability measure,"Networks, vol. 6, 1976.
[19] A.H. Esfahanian, "Generalized measures of faulttolerance with application of Ncube networks,"IEEE Trans. Comput., vol. 38, pp. 15861591, Nov. 1989.
[20] W. Najjar and J.L. Gaudiot, "Network resilience: a measure of network faulttolerance,"IEEE Trans. Computers, vol. 39, pp. 174181, Feb. 1990.
[21] A. Lagman, "An analysis of edge fault tolerance in recursively decomposable regular networks," Dept. Comp. Sci., Colorado State Univ.,Tech. Rep.CS92133, 1992.
[22] T.Y. Feng, "A survey of interconnection networks,"IEEE Computer Mag., vol. 14, pp. 1227, Dec. 1981.
[23] C. L. Seitzet al., "The architecture and programming of the Ametek Series 2010 Multicomputer," inProc. Third Conf. Hypercube Concurrent Comput. Appl., ACM, Jan. 1988, pp. 3337.
[24] W. J. Dallyet al., "The JMachine: A finegrain concurrent computer," inProc. IFIP Cong., 1989.
[25] J. P. Hayeset al., "Architecture of a hypercube supercomputer," inProc. 1986 Int. Conf. Parallel Processing, pp. 653660.
[26] W. Dally, "Network and processor architecture for messagedriven computers," inVLSI and Parallel Computation. Morgan Kaufmann Publishers, Inc., 1990, pp. 140222.
[27] S. B. Akers and B. Krishnamurthy, "A group theoretic model for symmetric interconnection networks,"Proc. 1986 Int. Conf. Parallel Processing, pp. 216223, 1986.
[28] P. K. Srimani, "Generalized fault tolerance properties of star graphs," inProc. ICCI 91, Ottawa, June 1991.
[29] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[30] W. Najjar and P. K. Srimani, "Network resilience of star graphs: a comparative analysis,"Proc. ACM CSC91, Texas, 1991.