An adaptive routing algorithm based on network partitioning for 3D Network-on-Chip

This paper presents an efficient routing algorithm for 3D meshes without virtual channels. The proposed routing algorithm is extended from 2D east-first routing algorithm and based on network partitioning. It is proven that the proposed method is free from deadlock. In comparison of previous routing algorithms, the average degree of adaptiveness is higher. This feature contributes to higher communication efficiency. Experimental results show that the proposed method can achieve lower communication latency and higher throughput over other traditional methods.

[1]  Radu Marculescu,et al.  DyAD - smart routing for networks-on-chip , 2004, Proceedings. 41st Design Automation Conference, 2004..

[2]  A. A. Chein,et al.  A cost and speed model for k-ary n-cube wormhole routers , 1998 .

[3]  Ge-Ming Chiu,et al.  The Odd-Even Turn Model for Adaptive Routing , 2000, IEEE Trans. Parallel Distributed Syst..

[4]  Terrence S. T. Mak,et al.  Deadlock-free and plane-balanced adaptive routing for 3D networks-on-chip , 2012, NoCArc '12.

[5]  Sudhakar Yalamanchili,et al.  Interconnection Networks , 2011, Encyclopedia of Parallel Computing.

[6]  Terrence S. T. Mak,et al.  Highly adaptive and deadlock-free routing for three-dimensional networks-on-chip , 2013, IET Comput. Digit. Tech..

[7]  Takahiro Watanabe,et al.  An Efficient Highly Adaptive and Deadlock-Free Routing Algorithm for 3D Network-on-Chip , 2016, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[8]  Salvatore Monteleone,et al.  Noxim: An open, extensible and cycle-accurate network on chip simulator , 2015, 2015 IEEE 26th International Conference on Application-specific Systems, Architectures and Processors (ASAP).

[9]  Lionel M. Ni,et al.  The Turn Model for Adaptive Routing , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.