A formal model of message blocking and deadlock resolution in interconnection networks
Authors:
- S. WamakulasuriyaSWS. Wamakulasuriya
- T.M. PinkstonTPT.M. Pinkston
- 1 March 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 11 (3) , 212-229
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- A general theory for deadlock-free adaptive routing using a mixed set of resourcesIEEE Transactions on Parallel and Distributed Systems, 2001
- Flexible and efficient routing based on progressive deadlock recoveryIEEE Transactions on Computers, 1999
- A distributed deadlock resolution algorithm for the AND modelIEEE Transactions on Parallel and Distributed Systems, 1999
- A general theory for deadlock avoidance in wormhole-routed networksIEEE Transactions on Parallel and Distributed Systems, 1998
- Efficient detection and resolution of generalized distributed deadlocksIEEE Transactions on Software Engineering, 1994
- An efficient distributed knot detection algorithmIEEE Transactions on Software Engineering, 1989
- Deadlock detection in distributed databasesACM Computing Surveys, 1987
- Distributed deadlock detectionACM Transactions on Computer Systems, 1983
- A Distributed Graph Algorithm: Knot DetectionACM Transactions on Programming Languages and Systems, 1982
- Some Deadlock Properties of Computer SystemsACM Computing Surveys, 1972