Adding Multiple-Fault Tolerance to Generalized Cube Networks

Authors:
C. J. Shih;K. E. Batcher
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 7
Cited 3

Interconnection networks for large-scale parallel processing: theory and case studies

Interconnection networks for large-scale parallel processing: theory and case studies
A Survey and Comparision of Fault-Tolerant Multistage Interconnection Networks

Computer
The Cubical Ring Connected Cycles: A Fault Tolerant Parallel Computation Network

IEEE Transactions on Computers
An analysis of cube-connected cycles and circular shuffle networks for parallel computations

Journal of Parallel and Distributed Computing
A Taxonomy of Reconfiguration Techniques for Fault-Tolerant Processor Arrays

Computer
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Microprocessors: Fundamentals and Applications

Microprocessors: Fundamentals and Applications

Multiple-Edge-Fault Tolerance with Respect to Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Tolerating Multiple Faults in Multistage Interconnection Networks with Minimal Extra Stages

IEEE Transactions on Computers
Optimal 1-edge fault-tolerant designs for ladders

Information Processing Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

Generalized cube networks are limited to single-fault tolerance with respect topermutation connections. The vector space approach presented here yields manyfault-tolerance schemes that can tolerate two and three faults. In each scheme,redundant switches and links are added to networks and interconnected in certain ways.These redundancies are represented by a matrix called the redundancy matrix. Afault-free network without redundancy is represented by an identity matrix. As faultyswitches and links are discovered, the remaining switches and links are remapped toestablish an intact network. The remapping is analogous to converting an invertibleredundancy matrix back to an identity matrix.