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.