edge-disjoint hamiltonian cycles in two-dimensional torus在二维环edge-disjoint哈密顿周期.pdfVIP

IJMMS 2004:25, 1299–1308 PII. S0161171204307325 © Hindawi Publishing Corp. EDGE-DISJOINT HAMILTONIAN CYCLES IN TWO-DIMENSIONAL TORUS MYUNG M. BAE, BADER F. ALBDAIWI, and BELLA BOSE Received 20 July 2003 The torus is one of the popular topologies for the interconnecting processors to build high- performance multicomputers. This paper presents methods to generate edge-disjoint Hamil- tonian cycles in 2D tori. 2000 Mathematics Subject Classification: 68M10. 1. Introduction. A multicomputer system consists of multiple nodes that commu- nicate by exchanging messages through an interconnection network. At a minimum, each node normally has one or more processing elements, a local memory, and a com- munication module. A popular topology for the interconnection network is the torus. Also called a wrap-around mesh or a toroidal mesh, this topology includes the k-ary n-cube which is an n-dimensional torus with the restriction that each dimension is of the same size, k, and the hypercube, which is a k-ary n-cube with k = 2; a mesh is a subgraph of a torus. Several parallel machines, both commercial and experimental, have been designed with a toroidal interconnection network. Included among these machines are the fol- lowing: the iWarp (torus) [ 5], Cray T3D and T3E (3D torus) [13], the Mosaic (k-ary n-cube) [14], and the Tera parallel computer (torus) [2]. Some topological properties of torus and k-ary n-cubes based on Lee distance are given in [6, 7]. The existence of disjoint Hamiltonian cycles in the cross-product of various graphs has been discussed in [ 1, 4, 8, 9, 10, 11, 15]; however, a straightforward way of generating such cycles was not known until the results in [ 3], where some simple ways of generating edge-disjoint Hamiltonia