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
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
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
The Message Flow Model for Routing in Wormhole-Routed Networks
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
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 General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches
IEEE Transactions on Parallel and Distributed Systems
ICS '02 Proceedings of the 16th international conference on Supercomputing
A Fault-Tolerant and Deadlock-Free Routing Protocol in 2D Meshes Based on Odd-Even Turn Model
IEEE Transactions on Computers
Deadlock-free multicasting in irregular networks using prefix routing
The Journal of Supercomputing
| Hi-index | 0.00 |
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. Keywords: Adaptive Routing, Channels, Deadlock-free Routing Algorithm, Hypercube, Mesh, Store-and-Forward, Subdigraph, Torus, Virtual Channel, Virtual Cut-through, Wormhole