Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal fully adaptive minimal wormhole routing for meshes
Journal of Parallel and Distributed Computing
A novel deadlock-free routing technique for a class of de Bruijn graph based networks
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Efficient deadlock-free wormhole routing in shuffle based networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
A Class of Partially Adaptive Routing Algorithms for n_dimensional Meshes
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 03
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
| Hi-index | 0.00 |
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.