A deadlock free and starvation free network of packet switching communication processors
- 1 January 1989
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 9 (2) , 147-162
- https://doi.org/10.1016/0167-8191(89)90125-7
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The torus routing chipDistributed Computing, 1986
- A simple livelock-free algorithm for packet switchingScience of Computer Programming, 1984
- Using Barrier Graphs for Deadlock Prevention in Communication NetworksIEEE Transactions on Communications, 1984
- A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet NetworksIEEE Transactions on Computers, 1981
- Deadlock-Free Packet Switching NetworksSIAM Journal on Computing, 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 Avoidance in Store-and-Forward Networks--II: Other Deadlock TypesIEEE Transactions on Communications, 1980
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975