A Sufficient Condition for Deadlock-Free Adaptive Routing in Mesh Networks

Deadlock remains a central problem in interconnection network. In this paper, we establish a new theory of deadlock-free flow control for k-ary, n-cube mesh network, which enables the use of any minimal-path adaptive routing algorithms while avoiding deadlock. We prove that the proposed flow control algorithm is a sufficient condition for deadlock freedom in any minimal path, adaptive routing algorithms on k-ary, n-cube mesh network.

[1]  José Duato,et al.  A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[2]  Cruz Izu,et al.  The Adaptive Bubble Router , 2001, J. Parallel Distributed Comput..

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

[4]  Zhang Minxuan,et al.  Dimensional Bubble Flow Control and Fully Adaptive Routing in the 2-D Mesh Network on Chip , 2008, 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing.

[5]  Lizhong Chen,et al.  Efficient implementation of globally-aware network flow control , 2012, J. Parallel Distributed Comput..

[6]  Natalie D. Enright Jerger,et al.  DBAR: An efficient routing algorithm to support multiple concurrent applications in networks-on-chip , 2011, 2011 38th Annual International Symposium on Computer Architecture (ISCA).

[7]  Lizhong Chen,et al.  Worm-Bubble Flow Control , 2013, 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA).