Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 1994 | public
Journal Article Open

Fault-tolerant de Bruijn and shuffle-exchange networks

Abstract

This paper addresses the problem of creating a fault-tolerant interconnection network for a parallel computer. Three topologies, namely, the base-2 de Bruijn graph, the base-m de Bruijn graph, and the shuffle-exchange, are studied. For each topology an N+k node fault-tolerant graph is defined. These fault-tolerant graphs have the property that given any set of k node faults, the remaining N nodes contain the desired topology as a subgraph. All of the constructions given are the best known in terms of the degree of the fault-tolerant graph. We also investigate the use of buses to reduce the degrees of the fault-tolerant graphs still further.

Additional Information

© Copyright 1994 IEEE. Reprinted with permission. Manuscript received January 15, 1992; revised May 28, 1993.

Files

BRUieeetpds94.pdf
Files (691.1 kB)
Name Size Download all
md5:47086c2c707d5a7a9fdd1aaedd6bc08e
691.1 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023