Higher dimensional Eisenstein-Jacobi networks

An efficient interconnection topology called Eisenstein-Jacobi (EJ) network has been proposed in Martinez et al. (2008). In this paper this concept is generalized to higher dimensions. Important properties such as distance distribution and the decomposition of higher dimensional EJ networks into edge-disjoint Hamiltonian cycles are explored in this paper. In addition, an optimal shortest path routing algorithm and a one-to-all broadcast algorithm for higher dimensional EJ networks are given. Further, we give comparisons between higher EJ networks and Generalized Hypercube (GHC) networks and we show that higher EJ networks cost less and have more nodes than GHC networks. Higher dimensional EJ network can be constructed based on lower dimensional EJ networks.The distance distribution of the nodes in the network is given.It is shown that higher dimensional EJ networks cost less and have more nodes than the GHC networks.The broadcasting algorithm for higher dimensional EJ network is discussed.A method of construction of edge disjoint Hamiltonian cycles is given with their Gray codes.

[1]  Ivan Stojmenovic,et al.  Addressing and Routing in Hexagonal Networks with Applications for Tracking Mobile Users and Connection Rerouting in Cellular Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[2]  Julio Solano-González,et al.  Higher dimensional hexagonal networks , 2003, J. Parallel Distributed Comput..

[3]  Ming-Syan Chen,et al.  Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors , 1990, IEEE Trans. Computers.

[4]  Arash Shamaei,et al.  Higher Dimensional Gaussian Networks , 2016, IEEE Trans. Parallel Distributed Syst..

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

[6]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[7]  Bella Bose,et al.  Efficient Communication Algorithms in Hexagonal Mesh Interconnection Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[8]  Abdullah Al-Dhelaan,et al.  Edge disjoint Hamiltonian cycles in Eisenstein-Jacobi networks , 2015, J. Parallel Distributed Comput..

[9]  Kang G. Shin.  HARTS: A Distributed Real-Time Architecture , 1991, Computer.

[10]  Myung M. Bae,et al.  Gray codes for torus and edge disjoint Hamiltonian cycles , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[11]  Zbigniew J. Czech,et al.  Introduction to Parallel Computing , 2017 .

[12]  Parameswaran Ramanathan,et al.  Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer , 1991, IEEE Trans. Computers.

[13]  Kang G. Shin,et al.  Reliable broadcast algorithms for HARTS , 1991, TOCS.

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

[15]  Jean Carle,et al.  Topological properties and optimal routing algorithms for three dimensional hexagonal networks , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

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

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

[18]  David Semé,et al.  3D hexagonal network: modeling, topological properties, addressing scheme, and optimal routing algorithm , 2005, IEEE Transactions on Parallel and Distributed Systems.

[19]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[20]  Bella Bose,et al.  Gray codes and edge disjoint Hamiltonian cycles in torus and hypercube , 2002, Proceedings IEEE International Symposium on Information Theory,.

[21]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[22]  Abdel Elah Al-Ayyoub,et al.  The Cross Product of Interconnection Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[23]  Zhang Yong-sheng.  The Subdivision of Global Multi-resolution Hexagonal Grid and the Rules of Address Coding , 2007 .

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

[25]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[26]  Arash Shamaei,et al.  Higher Dimensional Gaussian Networks , 2014, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops.

[27]  Bella Bose,et al.  The Topology of Gaussian and Eisenstein-Jacobi Interconnection Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[28]  Abdou Youssef.  Design and analysis of product networks , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.

[29]  Lewis Neale Lester,et al.  Computer graphics on a hexagonal grid , 1984, Comput. Graph..

[30]  Joseph N. Wilson,et al.  Array set addressing: enabling technology for the efficient processing of hexagonally sampled imagery , 2011, J. Electronic Imaging.

[31]  Myung M. Bae,et al.  Edge-disjoint Hamiltonian cycles in two-dimensional torus , 2004, Int. J. Math. Math. Sci..