A topology-independent generic methodology for deadlock-free wormhole routing

This paper introduces a generic methodology for developing deadlock-free routing in an arbitrary network by partitioning a graph into subdigraphs without cyclic dependencies and by strategically assigning virtual channels. We illustrate our scheme by identifying subdigraph characteristics that guarantee acyclic routing for n-dimensional hypercube, n-dimensional mesh and k-ary n-cube torus. Further generalization allows partial cyclic dependencies and forms a larger class of deadlock-free routing algorithms. We apply our technique to k-ary n-cube torus network and develop several novel deadlock-free, adaptive algorithms. Because our technique decomposes networks into several subdigraphs, it simplifies and generalizes the development of both static and adaptive deadlock-free routing algorithms for arbitrary networks