Adding Multiple-Fault Tolerance to Generalized Cube Networks

Generalized cube networks are limited to single-fault tolerance with respect to permutation connections. The vector space approach presented here yields many fault-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. A fault-free network without redundancy is represented by an identity matrix. As faulty switches and links are discovered, the remaining switches and links are remapped to establish an intact network. The remapping is analogous to converting an invertible redundancy matrix back to an identity matrix. >

[1]  José A. B. Fortes,et al.  A taxonomy of reconfiguration techniques for fault-tolerant processor arrays , 1990, Computer.

[2]  Shahram Latifi,et al.  The Efficiency of the Folded Hypercube in Subcube Allocation , 1990, International Conference on Parallel Processing.

[3]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[4]  Kenneth E. Batcher,et al.  Multiple-Fault Tolerant Cube-Connected Cycles Networks , 1991, ICPP.

[5]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[6]  W. Kent Fuchs,et al.  Reconfigurable Cube-Connected Cycles Architectures , 1990, J. Parallel Distributed Comput..

[7]  Wen C. Lin.  Microprocessors: Fundamentals and Applications , 1977 .

[8]  Satish K. Tripathi,et al.  An Analysis of Cube-Connected Cycles and Circular Shuffle Networks for Parallel Computation , 1988, J. Parallel Distributed Comput..

[9]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[10]  Shahram Latifi.  Subcube Embeddability of Folded Hypercubes , 1991, Parallel Process. Lett..

[11]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[12]  Nian-Feng Tzeng,et al.  Fault-Tolerant Cube-Connected Cycles Structures Through Dimensional Substitution , 1990, International Conference on Parallel Processing.

[13]  Shyh-Kwei Chen.  n+^-Cube: The Extra Dimensional n-Cube , 1990, ICPP.

[14]  Howard Jay Siegel,et al.  The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems , 1982, IEEE Transactions on Computers.

[15]  Howard Jay Siegel,et al.  A survey and comparison of fault-tolerant multistage interconnection networks , 1994 .

[16]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[17]  Prithviraj Banerjee.  The Cubical Ring Connected Cycles: A Fault-Tolerant Parallel Computation Network , 1988, IEEE Trans. Computers.

[18]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[19]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[20]  Shahram Latifi,et al.  On Folded Hypercubes , 1989, ICPP.

[21]  Dharma P. Agrawal,et al.  A Survey and Comparision of Fault-Tolerant Multistage Interconnection Networks , 1987, Computer.