Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward Deadlock
- 1 March 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 28 (3), 345-354
- https://doi.org/10.1109/tcom.1980.1094666
Abstract
Store-and-forward deadlock in store-and-forward networks may be avoided by forwarding messages from buffer to buffer in accordance with a loop-free directed buffer graph which accommodates all the desired message routes. Schemes for designing such buffer graphs are presented, together with methods for using them to forward the messages in an efficient and deadlock-free manner. These methods can be implemented by a set of counters at each node. Such an implementation increases the efficiency of buffer use, and simplifies jumping between normal lowoverhead operation when deadlock is far and more careful operation when deadlock is near. The proposed deadlock avoidance mechanism works for any network topology and any finite routing algorithm.Keywords
This publication has 5 references indexed in Scilit:
- Free buffer allocation — An investigation by simulationComputer Networks (1976), 1978
- Some comments on simulated datagram store-and-forward networksComputer Networks (1976), 1978
- Some Deadlock Properties of Computer SystemsACM Computing Surveys, 1972
- Flow Control in a Resource-Sharing Computer NetworkIEEE Transactions on Communications, 1972
- System DeadlocksACM Computing Surveys, 1971