An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks

The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks (INs) in such supercomputers play an important role. Metacube (MC) is an attractive IN that can connect extremely large number of nodes with small number of links, meanwhile it holds a short diameter and keeps the simplicity of routing algorithm. An MC(k, m) network can connect 2m2k+k nodes with m+k links per node, where k is the dimension of the high-level cubes (classes) and m is the dimension of the low-level cubes (clusters). For example, an MC(3,3) with 6 links per node can connect 227, or 134,217,728, nodes. In this paper, we show that the Metacube is Hamiltonian and give an efficient algorithm to construct a Hamiltonian cycle in Metacube networks.

[1]  Kanad Ghose,et al.  Hierarchical Cubic Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[2]  Sotirios G. Ziavras.  RH: A Versatile Family of Reduced Hypercube Interconnection Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[3]  Shietung Peng,et al.  Metacube: a new interconnection network for large scale parallel systems , 2002 .

[4]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[6]  L. W. Tucker,et al.  Architecture and applications of the Connection Machine , 1988, Computer.

[7]  Kemal Efe,et al.  The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..

[8]  Trevor Mudge,et al.  Hypercube supercomputers , 1989, Proc. IEEE.

[9]  Yamin Li,et al.  HAMILTONIAN CYCLE EMBEDDING FOR FAULT TOLERANCE IN DUAL-CUBE , 2002 .

[10]  Shietung Peng,et al.  Efficient communication in metacube: a new interconnection network , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.