
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J. Bruck, R. Cypher, C.T. Ho, "FaultTolerant de Bruijn and ShuffleExchange Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 5, pp. 548553, May, 1994.  
BibTex  x  
@article{ 10.1109/71.282566, author = {J. Bruck and R. Cypher and C.T. Ho}, title = {FaultTolerant de Bruijn and ShuffleExchange Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {5}, issn = {10459219}, year = {1994}, pages = {548553}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.282566}, 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  FaultTolerant de Bruijn and ShuffleExchange Networks IS  5 SN  10459219 SP548 EP553 EPD  548553 A1  J. Bruck, A1  R. Cypher, A1  C.T. Ho, PY  1994 KW  Index Termsmultiprocessor interconnection networks; graph theory; fault tolerant computing;shuffleexchange networks; faulttolerant interconnection network; parallel computer;base2 de Bruijn graph; faulttolerant graph VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
This paper addresses the problem of creating a faulttolerant interconnection network fora parallel computer. Three topologies, namely, the base2 de Bruijn graph, the basem deBruijn graph, and the shuffleexchange, are studied. For each topology an N+k nodefaulttolerant graph is defined. These faulttolerant graphs have the property that givenany set of k node faults, the remaining N nodes contain the desired topology as asubgraph. All of the constructions given are the best known in terms of the degree of thefaulttolerant graph. We also investigate the use of buses to reduce the degrees of thefaulttolerant graphs still further.
[1] J.C. Bermond and C. Peyrat, "de Bruijn and Kautz networks: A competitor for the hypercube?" in F. Andréand J. P. Verjus, Eds.,Hypercube and Distributed Computers. Amsterdam: Elsevier B.V. (NorthHolland), 1989, pp. 279293.
[2] J. Bruck, R. Cypher, and C.T. Ho, "On the construction of faulttolerant cubeconnected cycles networks,"Proc. 1991 Int. Conf. Parallel Processing, vol. I, pp. 692693.
[3] J. Bruck, R. Cypher, and C.T. Ho, "Faulttolerant meshes with minimal numbers of spares,"Proc. 1991 Symp. Parallel Distrib. Processing, pp. 288295.
[4] S. Dutt and J. P. Hayes, "On designing and reconfiguringkfaulttolerant tree architectures,"IEEE Trans. Comput., vol. C39, pp. 490503, Apr. 1990.
[5] S. Dutt and J. P. Hayes, "Designing faulttolerant systems using automorphisms,"J. Parallel Distributed Comput., pp. 249268, July 1991.
[6] S. Dutt and J. P. Hayes, "Some practical issues in the design of faulttolerant multiprocessors," inProc. 21st Int. Symp. on FaultTolerant Computing, 1991, pp. 292299.
[7] R. Feldmann and W. Unger, "The cubeconnected cycles network is a subgraph of the butterfly network,"Parallel Processing Lett., vol. 2, pp. 1319, Mar. 1992.
[8] A.H. Esfahanian and S. L. Hakimi, "Faulttolerant routing in de Bruijn communications networks,"IEEE Trans. Comput., vol. C34, pp. 777788, Sept. 1985.
[9] J. P. Hayes, "A graph model for faulttolerant computing systems,"IEEE Trans. Comput., vol. C25, no. 9, pp. 875884, Sept. 1976.
[10] S.Y. Kuo and W.K. Fuchs, "Reconfigurable cubeconnected cycles architectures,"J. Parallel Distributed Comput., vol. 9, pp. 110, May 1990.
[11] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[12] M. R. Samatham and D. K. Pradhan, "The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI,"IEEE Trans. Comput., vol. 38, pp. 567581, Apr. 1989.
[13] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, Feb. 1971.