Generic methodologies for deadlock-free routing

This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic dependencies among virtual channels. A novel fully adaptive nonminimal deadlock-free routing algorithm has been developed for k-ary n-cube torus network. Since our technique is based on decomposing a network into several subdigraphs, it simplifies and generalizes the development of both static and adaptive deadlock-free routing algorithms for arbitrary network topologies. We show that our methodology can be applied to store-and-forward and virtual cut-through routings as well.