Issue No. 05 - May (1994 vol. 5)

ISSN: 1045-9219

pp: 548-553

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.282566

ABSTRACT

<p>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.</p>

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, C.T. Ho, R. Cypher, "Fault-Tolerant de Bruijn and Shuffle-Exchange Networks",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 5, no. , pp. 548-553, May 1994, doi:10.1109/71.282566