Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
High performance communications in processor networks
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
The chaos router: a practical application of randomization in network routing
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Adaptive, minimal routing in hypercubes
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Greedy packet scheduling on shortest paths (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Efficient deadlock-free routing
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Bounds on the efficiency of message-passing protocols for parallel computers
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal Centralized Algorithms for Store-And-Forward Deadlock Avoidance
IEEE Transactions on Computers
Adaptive Deadlock- and Livelock-Free Routing in the Hypercube Network
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
Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks
IEEE Transactions on Computers
IEEE Transactions on Computers
ROMM routing on mesh and torus networks
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
A Theory of Fault-Tolerant Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Deadlock prevention by acyclic orientations
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
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
A method to remove deadlocks in networks-on-chips with wormhole flow control
Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.01 |
This paper studies the problem of deadlock-free packet routing in parallel and distributed architectures. We present three main results. First, we show that the standard technique of ordering the queues so that every packet always has the possibility of moving to a higher ordered queue is not necessary for deadlock-freedom. Second, we show that every deadlock-free, adaptive packet routing algorithm can be restricted, by limiting the adaptivity available, to obtain an oblivious algorithm which is also deadlock-free. Third, we show that any packet routing algorithm for a cycle or torus network which is free of deadlock and which uses only minimal length paths must require at least three queues in some node. This matches the known upper bound of three queues per node for deadlock-free, minimal packet routing on cycle and torus networks.