This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault-Tolerant de Bruijn and Shuffle-Exchange Networks
May 1994 (vol. 5 no. 5)
pp. 548-553

This paper addresses the problem of creating a fault-tolerant interconnection network fora parallel computer. Three topologies, namely, the base-2 de Bruijn graph, the base-m deBruijn graph, and the shuffle-exchange, are studied. For each topology an N+k nodefault-tolerant graph is defined. These fault-tolerant 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 thefault-tolerant graph. We also investigate the use of buses to reduce the degrees of thefault-tolerant 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. (North-Holland), 1989, pp. 279-293.
[2] J. Bruck, R. Cypher, and C.-T. Ho, "On the construction of fault-tolerant cube-connected cycles networks,"Proc. 1991 Int. Conf. Parallel Processing, vol. I, pp. 692-693.
[3] J. Bruck, R. Cypher, and C.-T. Ho, "Fault-tolerant meshes with minimal numbers of spares,"Proc. 1991 Symp. Parallel Distrib. Processing, pp. 288-295.
[4] S. Dutt and J. P. Hayes, "On designing and reconfiguringk-fault-tolerant tree architectures,"IEEE Trans. Comput., vol. C-39, pp. 490-503, Apr. 1990.
[5] S. Dutt and J. P. Hayes, "Designing fault-tolerant systems using automorphisms,"J. Parallel Distributed Comput., pp. 249-268, July 1991.
[6] S. Dutt and J. P. Hayes, "Some practical issues in the design of fault-tolerant multiprocessors," inProc. 21st Int. Symp. on Fault-Tolerant Computing, 1991, pp. 292-299.
[7] R. Feldmann and W. Unger, "The cube-connected cycles network is a subgraph of the butterfly network,"Parallel Processing Lett., vol. 2, pp. 13-19, Mar. 1992.
[8] A.-H. Esfahanian and S. L. Hakimi, "Fault-tolerant routing in de Bruijn communications networks,"IEEE Trans. Comput., vol. C-34, pp. 777-788, Sept. 1985.
[9] J. P. Hayes, "A graph model for fault-tolerant computing systems,"IEEE Trans. Comput., vol. C-25, no. 9, pp. 875-884, Sept. 1976.
[10] S.-Y. Kuo and W.K. Fuchs, "Reconfigurable cube-connected cycles architectures,"J. Parallel Distributed Comput., vol. 9, pp. 1-10, May 1990.
[11] F. P. Preparata and J. Vuillemin, "The cube-connected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300-309, 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. 567-581, Apr. 1989.
[13] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, pp. 153-161, Feb. 1971.

Index Terms:
Index Termsmultiprocessor interconnection networks; graph theory; fault tolerant computing;shuffle-exchange networks; fault-tolerant interconnection network; parallel computer;base-2 de Bruijn graph; fault-tolerant graph
Citation:
J. Bruck, R. Cypher, C.T. Ho, "Fault-Tolerant de Bruijn and Shuffle-Exchange Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 5, pp. 548-553, May 1994, doi:10.1109/71.282566
Usage of this product signifies your acceptance of the Terms of Use.