PROJECT TITLE :

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

ABSTRACT:

Deadlock remains a central problem in interconnection network. During this paper, we establish a new theory of deadlock-free flow management for k-ary, n-cube mesh network, that enables the employment of any minimal-path adaptive routing algorithms whereas 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.