Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
@article{Dally1987DeadlockFreeMR, title={Deadlock-Free Message Routing in Multiprocessor Interconnection Networks}, author={W. Dally and C. Seitz}, journal={IEEE Transactions on Computers}, year={1987}, volume={C-36}, pages={547-553} }
A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n… CONTINUE READING
2,282 Citations
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
- Computer Science
- IEEE Trans. Parallel Distributed Syst.
- 1993
- 560
- PDF
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks
- Computer Science
- DISC
- 1998
- 5
- PDF
Generic methodologies for deadlock-free routing
- Computer Science
- Proceedings of International Conference on Parallel Processing
- 1996
- 13
- Highly Influenced
A Sufficient Condition for Deadlock-Free Adaptive Routing in Mesh Networks
- Computer Science
- IEEE Computer Architecture Letters
- 2015
- 5
Deadlock-Free Routing in k-Ary Hypercube Network in Presence of Processor Failures
- Computer Science
- Inf. Process. Lett.
- 1990
- 8
A Deadlock Free Routing Algorithm with Network Size Independent Buffering Space
- Computer Science
- CONPAR
- 1990
- 12
A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks
- Computer Science
- J. Parallel Distributed Comput.
- 2001
- 3
- Highly Influenced
On Deadlocks In Interconnection Networks
- Computer Science
- Conference Proceedings. The 24th Annual International Symposium on Computer Architecture
- 1997
- 56
References
SHOWING 1-10 OF 20 REFERENCES
Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock
- Computer Science
- IEEE Transactions on Communications
- 1980
- 163
A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks
- Computer Science
- IEEE Transactions on Computers
- 1981
- 94
- PDF
The cube-connected-cycles: A versatile network for parallel computation
- Computer Science
- 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
- 1979
- 315
- PDF
The cube-connected cycles: a versatile network for parallel computation
- Computer Science
- CACM
- 1981
- 862
- PDF
Virtual Cut-Through: A New Computer Communication Switching Technique
- Computer Science
- Comput. Networks
- 1979
- 1,016
The extension of object-oriented languages to a homogeneous, concurrent architecture
- Computer Science
- 1982
- 40