This Article 
 Bibliographic References 
 Add to: 
Adding Multiple-Fault Tolerance to Generalized Cube Networks
August 1994 (vol. 5 no. 8)
pp. 785-792

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.

[1] G. B. Adams and H. J. Siegel, "The extra stage cube: A fault-tolerant interconnection network for supersystems,"IEEE Trans. Comput., vol. 31, no. 5, pp. 443-454, May 1982.
[2] G. B. Adams, D. P. Agrawal, and H. J. Siegel, "A survey and comparison of fault-tolerant multistage interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 14-27, June 1987.
[3] P. Banerjee, S. Y. Kuo and W. K. Fuchs, "Reconfigurable cube-connected cycles architectures,"Proc. 16th Int. Symp. Fault-Tolerant Computing, 1986, pp. 286-291.
[4] P. Banerjee, "The cubical ring connected cycles: A Fault-tolerant parallel computation network,"IEEE Trans. Comput., vol. 37, pp. 632-636, May 1988.
[5] K. E. Batcher, "Sorting networks and their applications,"1968 Spring Joint Comput. Conf., AFIPS Proc., vol. 32, pp. 307-314.
[6] K. E. Batcher, "The flip network in STARAN,"Proc. ICPP, 1976, pp. 65-71.
[7] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. 29, no. 9, pp. 836-840, Sept. 1980.
[8] M. Chean and J. A. B. Fortes, "A taxonomy of reconfiguration techniques for fault-tolerant processor arrays,"IEEE Comput., pp. 55-69, 1990.
[9] S. K. Chen, "n+-cube: The extra dimensionaln-cube,"Proc. ICPP, 1990, pp. 583-584.
[10] B. N. Jain and S. K. Tripathi, "An analysis of cube-connected cycles and circular shuffle networks for parallel computation,"J. Parallel Distrib. Computing, vol. 5, pp. 741-754, 1988.
[11] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[12] D. E. Knuth, personal correspondence.
[13] S. Latifi and A. El-Amawy, "On folded hypercubes,"Proc. ICPP, vol. I, 1989, 180-187.
[14] S. Latifi, "The efficiency of the folded hypercube in subcube allocation,"Proc. ICPP, Aug. 1990, 1218-221.
[15] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. 24, pp. 1145-1155, Dec. 1975.
[16] S. Lin and D.J. Costello Jr.,Error Control Coding, Fundamentals and Applications, Prentice Hall, Englewood Cliffs, N.J., 1983.
[17] M. O'Nan and H. Enderton,Linear Algebra, 3rd Ed. Orlando, FL: Harcourt Brace Jovanovich, 1990.
[18] M. C. Pease, "The indirect binaryn-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
[19] C. J. Shih and K. E. Batcher, "Multiple-fault tolerant cube-connected cycles networks,"Proc. ICPP, 1991, pp. 327-331.
[20] H. J. Siegel,Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[21] H. J. Siegel, W. T. Hsu, and M. Jeng, "An introduction to the multistage cube family of interconnection networks,"J. Supercomputing, vol. 1, pp. 13-42, 1987.
[22] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. 20, no. 2, pp. 153-161, Feb. 1971.
[23] N. F. Tzeng, S. Bhattacharga, and P. J. Chuang, "Fault-tolerant cube-connected cycles structures through dimensional substitution,"Proc. ICPP, 1990, pp. 433-440.
[24] C. Wu and T. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. 29, pp. 694-702, Aug. 1980.

Index Terms:
Index Termsfault tolerant computing; reliability; hypercube networks; parallel processing;multiple-fault tolerance; generalized cube networks; permutation connections; vectorspace approach
C.J. Shih, K.E. Batcher, "Adding Multiple-Fault Tolerance to Generalized Cube Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 8, pp. 785-792, Aug. 1994, doi:10.1109/71.298202
Usage of this product signifies your acceptance of the Terms of Use.