Prevention of Deadlocks in Packet-Switched Data Transport Systems
- 1 April 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 29 (4) , 512-524
- https://doi.org/10.1109/tcom.1981.1095021
Abstract
This paper first Surveys a number of potential deadlocks inherent in store-and-forward networks and outlines corresponding countermeasures. It then goes on to a more detailed treatment of the most important deadlock types. Finally, necessary and sufficient conditions are given and proven for the use of process ordering and generalized resource ordering techniques to avoid deadlocks in arbitrary systems of interacting processes.Keywords
This publication has 14 references indexed in Scilit:
- The Deadlock Problem: An OverviewComputer, 1980
- Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward DeadlockIEEE Transactions on Communications, 1980
- Flow Control in the GMD-NetworkPublished by Springer Nature ,1979
- Free buffer allocation — An investigation by simulationComputer Networks (1976), 1978
- Principles and lessons in packet communicationsProceedings of the IEEE, 1978
- Some Deadlock Properties of Computer SystemsACM Computing Surveys, 1972
- Comment on deadlock preventive methodCommunications of the ACM, 1972
- Flow Control in a Resource-Sharing Computer NetworkIEEE Transactions on Communications, 1972
- Computer communication network design: Experience with theory and practiceNetworks, 1972
- Comments on prevention of system deadlocksCommunications of the ACM, 1971