Subscribe

Issue No.08 - August (2010 vol.21)

pp: 1132-1142

Mary Flahive , Oregon State University, Corvallis

Bella Bose , Oregon State University, Corvallis

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.132

ABSTRACT

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.

INDEX TERMS

Interconnection network, Gaussian integers, Eisenstein-Jacobi integers, routing in networks, diameter of a network.

CITATION

Mary Flahive, Bella Bose, "The Topology of Gaussian and Eisenstein-Jacobi Interconnection Networks",

*IEEE Transactions on Parallel & Distributed Systems*, vol.21, no. 8, pp. 1132-1142, August 2010, doi:10.1109/TPDS.2009.132REFERENCES

- [1] "Cray XIE Data Sheet," http://www.cray.comindex.html, 2009.
- [2] N.R. Adiga et al., "An Overview of the BlueGene/L Supercomputer, Supercomputing 2002 Technical Papers," http:// sc-2002.org/paperpdfspap.pap207.pdf , Nov. 2002.
- [3] M. Anantha, "Gray Codes and Their Applications," PhD thesis, School of EECS, Oregon State Univ., 2007.
- [4] M. Bae and B. Bose, "Gray Codes and Edge-Disjoint Hamiltonian Cycles in $k$ -Ary $n$ -Cubes and Hypercubes,"
IEEE Trans. Computers, vol. 52, no. 10, pp. 1271-1284, Oct. 2003.- [5] J.C. Bermond, F. Commellas, and D.F. Hsu, "Distributed Loop Computer Networks: A Survey,"
J. Parallel and Distributed Computing, vol. 24, pp. 2-10, 1995.- [6] D.P. Bersekas and J.N. Tsitsiklis,
Parallel and Distributed Computing: Numerical Methods. Prentice Hall, 1989.- [7] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of $k$ -Ary $n$ -Cubes,"
IEEE Trans. Computers, vol. 44, no. 8, pp. 1021-1030, Aug. 1995.- [8] Z. Cvetanovic, "Performance Analysis of the Alpha 21364-Based HP GS1280 Multiprocessor,"
Proc. 30th Ann. Int'l Symp. Computer Architecture, pp. 218-228, 2003.- [9] J. Duato, S. Yalamanchili, and L. Ni,
Interconnection Networks: An Engineering Approach. IEEE Press, 1997.- [10] Y. Fan and Y. Gao, "Codes over Algebraic Integer Rings of Cyclotomic Fields,"
IEEE Trans. Information Theory, vol. 50, no. 1, pp. 194-200, Jan. 2004.- [11] G.H. Hardy and E.M. Wright,
An Introduction to the Theory of Numbers. Claredon Press, 1979.- [12] K. Huber, "Codes over Gaussian Integers,"
IEEE Trans. Information Theory, vol. 40, no. 1, pp. 207-216, Jan. 1994.- [13] K. Huber, "Codes over Eisenstein-Jacobi Integers,"
Finite Fields: Theory, Applications, and Algorithms, Am. Math. Soc., pp. 165-179, 1994.- [14] J.H. Jordan and C.J. Potratz, "Complete Residue Systems in the Gaussian Integers,"
Math. Magazine, vol. 38, pp. 1-12, 1965.- [15] V. Kumar et al.,
Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin/Cummings, 1994.- [16] F.T. Leighton,
Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann, 1991.- [17] C. Martínez, R. Beivide, E. Stafford, M. Moretó, and E. Gabidulin, "Modeling Toroidal Networks with the Gaussian Integers,"
IEEE Trans. Computers, vol. 57, no. 8, pp. 1046-1056, Aug. 2008.- [18] C. Martínez, E. Stafford, R. Beivide, and E.M. Gabidulin, "Modeling Hexagonal Networks with the Eisenstein-Jacobi Graphs,"
Problems of Information Transmission, pp. 1-11, 2008.- [19] C. Martínez, E. Vallejo, R. Beivide, C. Isu, and M. Moretó, "Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors,"
Int'l J. Parallel Programming, vol. 33, pp. 193-211, 2006.- [20] C. Martínez, R. Beivide, and E. Gabidulin, "Perfect Codes for Metrics Induced by Circulant Graphs,"
IEEE Trans. Information Theory, vol. 53, no. 9, pp. 3042-3052, Sept. 2007.- [21] M.R. Murty and N. Thain, "Pick's Theorem via Minkowski's Theorem,"
Am. Math. Monthly, vol. 114, pp. 732-736, 2007.- [22] S.L. Scott and G.M. Thorson, "The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus,"
Proc. Symp. High Performance Interconnects (HOT Interconnects IV), Aug. 1996. |