
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
C.J. Shih, K.E. Batcher, "Adding MultipleFault Tolerance to Generalized Cube Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 8, pp. 785792, August, 1994.  
BibTex  x  
@article{ 10.1109/71.298202, author = {C.J. Shih and K.E. Batcher}, title = {Adding MultipleFault Tolerance to Generalized Cube Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {8}, issn = {10459219}, year = {1994}, pages = {785792}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.298202}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Adding MultipleFault Tolerance to Generalized Cube Networks IS  8 SN  10459219 SP785 EP792 EPD  785792 A1  C.J. Shih, A1  K.E. Batcher, PY  1994 KW  Index Termsfault tolerant computing; reliability; hypercube networks; parallel processing;multiplefault tolerance; generalized cube networks; permutation connections; vectorspace approach VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Generalized cube networks are limited to singlefault tolerance with respect topermutation connections. The vector space approach presented here yields manyfaulttolerance 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. Afaultfree 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 faulttolerant interconnection network for supersystems,"IEEE Trans. Comput., vol. 31, no. 5, pp. 443454, May 1982.
[2] G. B. Adams, D. P. Agrawal, and H. J. Siegel, "A survey and comparison of faulttolerant multistage interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 1427, June 1987.
[3] P. Banerjee, S. Y. Kuo and W. K. Fuchs, "Reconfigurable cubeconnected cycles architectures,"Proc. 16th Int. Symp. FaultTolerant Computing, 1986, pp. 286291.
[4] P. Banerjee, "The cubical ring connected cycles: A Faulttolerant parallel computation network,"IEEE Trans. Comput., vol. 37, pp. 632636, May 1988.
[5] K. E. Batcher, "Sorting networks and their applications,"1968 Spring Joint Comput. Conf., AFIPS Proc., vol. 32, pp. 307314.
[6] K. E. Batcher, "The flip network in STARAN,"Proc. ICPP, 1976, pp. 6571.
[7] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. 29, no. 9, pp. 836840, Sept. 1980.
[8] M. Chean and J. A. B. Fortes, "A taxonomy of reconfiguration techniques for faulttolerant processor arrays,"IEEE Comput., pp. 5569, 1990.
[9] S. K. Chen, "n+cube: The extra dimensionalncube,"Proc. ICPP, 1990, pp. 583584.
[10] B. N. Jain and S. K. Tripathi, "An analysis of cubeconnected cycles and circular shuffle networks for parallel computation,"J. Parallel Distrib. Computing, vol. 5, pp. 741754, 1988.
[11] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: AddisonWesley, 1973.
[12] D. E. Knuth, personal correspondence.
[13] S. Latifi and A. ElAmawy, "On folded hypercubes,"Proc. ICPP, vol. I, 1989, 180187.
[14] S. Latifi, "The efficiency of the folded hypercube in subcube allocation,"Proc. ICPP, Aug. 1990, 1218221.
[15] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. 24, pp. 11451155, 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 binaryncube microprocessor array,"IEEE Trans. Comput., vol. C26, pp. 458473, May 1977.
[19] C. J. Shih and K. E. Batcher, "Multiplefault tolerant cubeconnected cycles networks,"Proc. ICPP, 1991, pp. 327331.
[20] H. J. Siegel,Interconnection Networks for LargeScale 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. 1342, 1987.
[22] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. 20, no. 2, pp. 153161, Feb. 1971.
[23] N. F. Tzeng, S. Bhattacharga, and P. J. Chuang, "Faulttolerant cubeconnected cycles structures through dimensional substitution,"Proc. ICPP, 1990, pp. 433440.
[24] C. Wu and T. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. 29, pp. 694702, Aug. 1980.