The Topology of Gaussian and Eisenstein-Jacobi Interconnection Networks

Earlier authors have used quotient rings of Gaussian and Eisenstein-Jacobi integers to construct interconnection networks with good topological properties. In this paper, we present a unified study of these two types of networks. Our results include decomposing the edges into disjoint Hamiltonian cycles, a simplification of the calculation of the Eisenstein-Jacobi distance, a distribution of the distances between Eisenstein-Jacobi nodes, and shortest path routing algorithms. In particular, the known Gaussian routing algorithm is simplified.

[1]  Ramón Beivide,et al.  Modeling Toroidal Networks with the Gaussian Integers , 2008, IEEE Transactions on Computers.

[2]  Gary L. Mullen,et al.  Finite Fields: Theory, Applications and Algorithms , 1994 .

[3]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

[4]  Klaus Huber.  Codes over Gaussian integers , 1994, IEEE Trans. Inf. Theory.

[5]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[6]  Ramón Beivide,et al.  Perfect Codes for Metrics Induced by Circulant Graphs , 2007, IEEE Transactions on Information Theory.

[7]  Steven L. Scott,et al.  The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus , 1996 .

[8]  E T. Leighton,et al.  Introduction to parallel algorithms and architectures , 1991 .

[9]  BroegBob,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995 .

[10]  Cruz Izu,et al.  Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors , 2006, International Journal of Parallel Programming.

[11]  Zarka Cvetanovic.  Performance analysis of the Alpha 21364-based HP GS1280 multiprocessor , 2003, ISCA '03.

[12]  K. Huber,et al.  Codes over Eisenstein-Jacobi integers , 1994 .

[13]  Bella Bose,et al.  Gray codes and their applications , 2007 .

[14]  M. Ram Murty,et al.  Pick's Theorem via Minkowski's Theorem , 2007, Am. Math. Mon..

[15]  J. H. Jordan,et al.  Complete Residue Systems in the Gaussian Integers , 1965 .

[16]  David F. Heidel,et al.  An Overview of the BlueGene/L Supercomputer , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[17]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[18]  Myung M. Bae,et al.  Edge Disjoint Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes , 2003, IEEE Trans. Computers.

[19]  D. Frank Hsu,et al.  Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..

[20]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[21]  Ramón Beivide,et al.  Modeling hexagonal constellations with Eisenstein-Jacobi graphs , 2008, Probl. Inf. Transm..

[22]  Ying Gao,et al.  Codes over algebraic integer rings of cyclotomic fields , 2004, IEEE Trans. Inf. Theory.