Adaptive routing in hexagonal torus interconnection networks

The hexagonal torus network is a degree six toroidal network with rich topological properties. It was used in the design of HARTS machine at the University of Michigan, and more recently it has been proposed for cellular networks. The low diameter and less average hop distance of this network make it advantageous over other 2D toroidal network such as meshes and tori. This paper proposes a fully adaptive and deadlock-free routing algorithm for hexagonal torus networks based on virtual channel partitioning and the algorithm requires three virtual channels per physical channel to remain deadlock-free. Simulation results show that this algorithm is superior to the fully adaptive routing algorithm for 2D meshes and 2D tori of the same size.

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

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

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

[4]  Allan Porterfield,et al.  The Tera computer system , 1990 .

[5]  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..

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

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

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

[9]  Hamid Sarbazi-Azad,et al.  XMulator: A Listener-Based Integrated Simulation Platform for Interconnection Networks , 2007, First Asia International Conference on Modelling & Simulation (AMS'07).

[10]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

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

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

[13]  William J. Dally,et al.  The J-machine Multicomputer: An Architectural Evaluation , 1993, Proceedings of the 20th Annual International Symposium on Computer Architecture.

[14]  José Duato,et al.  A new theory of deadlock-free adaptive multicast routing in wormhole networks , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[15]  Z. Cvetanovic.  Performance analysis of the Alpha 21364-based HP GS1280 multiprocessor , 2003, 30th Annual International Symposium on Computer Architecture, 2003. Proceedings..

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

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

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