Adaptive routing algorithms and implementation for TESH network

The Tori-connected mESH (TESH) Network is a k-ary n-cube networks of multiple basic modules, in which the basic modules are 2D-mesh networks that are hierarchically interconnected for higher level k-ary n-cube networks. Many adaptive routing algorithms for k-ary n-cube networks have already been proposed. Thus, those algorithms can also be applied to TESH network. We have proposed three adaptive routing algorithms—channel-selection, link-selection, and dynamic dimension reversal—for the efficient use of network resources of a TESH network to improve dynamic communication performance. In this paper, we implement these routers using VHDL and evaluate the hardware cost and delay for the proposed routing algorithms and compare it with the dimension order routing. The delay and hardware cost of the proposed adaptive routing algorithms are almost equal to that and slightly higher than that of dimension order routing, respectively. Also we evaluate the communication performance with hardware implementation. It is found that the communication performance of a TESH network using these adaptive algorithms is better than when the dimension-order routing algorithm is used.

[1]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[2]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[3]  William J. Dally.  Virtual-channel flow control , 1990, ISCA '90.

[4]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[5]  Maximally Fully Adaptive Routing in 2D Meshes , 1992, ICPP.

[6]  William J. Dally,et al.  Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..

[7]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

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

[9]  V. K. Jain,et al.  Reconfiguration and yield for TESH: a new hierarchical interconnection network for 3-D integration , 1996, 1996 Proceedings. Eighth Annual IEEE International Conference on Innovative Systems in Silicon.

[10]  C. S. Yang,et al.  Adaptive routing in k-ary n-cube multicomputers , 1996, Proceedings of 1996 International Conference on Parallel and Distributed Systems.

[11]  Vijay K. Jain,et al.  VLSI considerations for TESH: a new hierarchical interconnection network for 3-D integration , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[12]  Susumu Horiguchi,et al.  A deadlock-free routing for hierarchical interconnection network: TESH , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[13]  Susumu Horiguchi,et al.  An adaptive routing for hierarchical interconnection network TESH , 2002 .

[14]  Glenn H. Chapman,et al.  3D heterogeneous sensor system on a chip for defense and security applications , 2004, SPIE Defense + Commercial Sensing.

[15]  Glenn H. Chapman,et al.  Defect avoidance in a 3-D heterogeneous sensor [acoustic/seismic/active pixel/IR imaging sensor array] , 2004, 19th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 2004. DFT 2004. Proceedings..

[16]  Hideharu Amano,et al.  A Simple Data Transfer Technique Using Local Address for Networks-on-Chips , 2006, IEEE Transactions on Parallel and Distributed Systems.

[17]  A. Kumary,et al.  A 4.6Tbits/s 3.6GHz single-cycle NoC router with a novel switch allocator in 65nm CMOS , 2007 .

[18]  Jungang Han,et al.  RTTM: A New Hierarchical Interconnection Network for Massively Parallel Computing , 2009, HPCA.