A versatile ring-connected hypercube

Our work in deriving and comparing the reliability formulas for three leading hypercubic models-the original hypercube, Shih's cube, and the ring-connected hypercube-demonstrates the superiority of the ring-connected hypercube (RCH) approach. Though it needs twice the links of the original hypercube network, which is the best result to date, the RCH can recover from node failures. The higher resultant reliability of this fault-tolerant architecture makes the RCH an attractive candidate for many critical parallel-computation applications.<<ETX>>

[1]  Sheng-De Wang,et al.  Ring-connected hypercubes and their relationship to cubical ring connected cycles and dynamic redundancy networks , 1993, CSC '93.

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

[3]  D. Frank Hsu,et al.  Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..

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

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

[6]  F. C. Piper,et al.  FINITE GROUPS OF AUTOMORPHISMS , 1974 .

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

[8]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[9]  Barry W. Johnson.  Design & analysis of fault tolerant digital systems , 1988 .

[10]  John P. Hayes,et al.  Designing Fault-Tolerant System Using Automorphisms , 1991, J. Parallel Distributed Comput..

[11]  Jehoshua Bruck,et al.  Efficient fault-tolerant mesh and hypercube architectures , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[12]  Kenneth E. Batcher,et al.  Adding Multiple-Fault Tolerance to Generalized Cube Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[13]  Ralph Tindell,et al.  Circulants and their connectivities , 1984, J. Graph Theory.