Prevention of Store-and-Forward Deadlock in Computer Networks
- 1 December 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 33 (12), 1258-1264
- https://doi.org/10.1109/tcom.1985.1096253
Abstract
Much previous work has been done on the prevention of store-and-forward deadlock in computer networks using buffer reservation. The emphasis has been on reducing the number of reserved buffers necessary in each node. In this paper, we propose a scheme that, for most networks, will guarantee deadlock freedom for any arbitrary routing with a third fewer reserved buffers than the best previously proposed scheme.Keywords
This publication has 8 references indexed in Scilit:
- Deadlock-Resistant Flow Control Procedures for Store-and-Forward NetworksIEEE Transactions on Communications, 1984
- Computer communications: Milestones and propheciesIEEE Communications Magazine, 1984
- Distributed network protocolsIEEE Transactions on Information Theory, 1983
- A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet NetworksIEEE Transactions on Computers, 1981
- Prevention of Deadlocks in Packet-Switched Data Transport SystemsIEEE Transactions on Communications, 1981
- Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward DeadlockIEEE Transactions on Communications, 1980
- Deadlock- and livelock-free packet switching networksPublished by Association for Computing Machinery (ACM) ,1980
- Deadlock-free packet switching networksPublished by Association for Computing Machinery (ACM) ,1979