Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Reconfigurable cube-connected cycles architecture
Journal of Parallel and Distributed Computing
On Designing and Reconfiguring k-Fault-Tolerant Tree Architectures
IEEE Transactions on Computers
Designing fault-tolerant systems using automorphisms
Journal of Parallel and Distributed Computing
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Gracefully Degradable Pipeline Networks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Bidirectional versus Unidirectional Networks: Cost/Performance Trade-Offs
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
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.