This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes
January 1995 (vol. 44 no. 1)
pp. 150-155

Abstract—Hypercubes, meshes and tori are well known interconnection networks for parallel computers. The sets of edges in those graphs can be partitioned to dimensions. It is well known that the hypercube can be extended by adding a wildcard dimension resulting in a folded hypercube that has better fault-tolerant and communication capabilities. First we prove that the folded hypercube is optimal in the sense that only a single wildcard dimension can be added to the hypercube. We then investigate the idea of adding wildcard dimensions to d-dimensional meshes and tori. Using techniques from error correcting codes we construct d-dimensional meshes and tori with wildcard dimensions. Finally, we show how these constructions can be used to tolerate edge and node faults in mesh and torus networks.

[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] B. Alspach,“Cayley graphs with optimal fault tolerance,”IEEE Trans. Comput., vol. 41, no. 10, pp. 1337–1339, Oct. 1992.
[3] R. S. Bajwa and S. R. Seidel,“Communication algorithms for tori and grids,”Tech. Rep. TR 89-04, Dep. of Comput. Sci., Michigan Technological Univ., Nov. 1989.
[4] J. Bruck, R. Cypher, and C.-T. Ho,“On the construction of fault-tolerant cube connected cycles networks,”inProc. Int. Conf. Parallel Processing, vol. 1, pp. 692–693, Penn State Univ., 1991.
[5] ——,“Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes,”inProc. 23rd Int. Symp. Fault-Tolerant Computing, June 1993, pp. 260–267.
[6] ——,“Fault-tolerant meshes and hypercubes with minimal numbers of spares,”IEEE Trans. Comput., vol. 42, no. 9, pp. 1089–1104, Sept. 1993.
[7] P. Fraigniaud and E. Lazard,“Methods and problems of communication in usual networks,”Tech. Rep. 91-33, IMAG, Ecole Normale Supérieure de Lyon, France, Oct. 1991.
[8] A. Ghafoor, T. R. Bashkow, and I. Ghafoor,“Bisectional fault-tolerant communication architecture for supercomputer systems,”IEEE Trans. Comput., vol. 38, no. 10, pp. 1425–1446, Oct. 1989.
[9] C.-T. Ho,“Full bandwidth communications on folded hypercubes,”inProc. Int. Conf. Parallel Processing,vol. I, Penn State, 1989, pp. 276–280.
[10] ——,“An observation on the bisectional interconnection networks,”IEEE Trans. Comput., vol. 41, no. 7, pp. 873–877, July 1992.
[11] S. Latifi and A. El-Amawy,“on folded hypercubes,”inProc. Int. Conf. Parallel Processing, vol. I, Penn State, 1989, pp. 180–187.
[12] F. J. MacWilliams and N. J. A. Sloane,The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
[13] M. E. Watkins,“Connectivity of transitive graphs,”J. Combinat. Theory, vol. 8, 23–29, 1970.

Citation:
Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, "Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes," IEEE Transactions on Computers, vol. 44, no. 1, pp. 150-155, Jan. 1995, doi:10.1109/12.367998
Usage of this product signifies your acceptance of the Terms of Use.