Characterization of deadlocks in k-ary n-cube networks
Authors:
- T.M. PinkstonTPT.M. Pinkston
- S. WarnakulasuriyaSWS. Warnakulasuriya
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 10 (9) , 904-921
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Flexible and efficient routing based on progressive deadlock recoveryIEEE Transactions on Computers, 1999
- Compressionless routing: a framework for adaptive and fault-tolerant routingIEEE Transactions on Parallel and Distributed Systems, 1997
- Efficient detection and resolution of generalized distributed deadlocksIEEE Transactions on Software Engineering, 1994
- Deadlock-free adaptive routing in multicomputer networks using virtual channelsIEEE Transactions on Parallel and Distributed Systems, 1993
- A new theory of deadlock-free adaptive routing in wormhole networksIEEE Transactions on Parallel and Distributed Systems, 1993
- An efficient distributed knot detection algorithmIEEE Transactions on Software Engineering, 1989
- Deadlock detection in distributed databasesACM Computing Surveys, 1987
- A Distributed Graph Algorithm: Knot DetectionACM Transactions on Programming Languages and Systems, 1982
- Virtual cut-through: A new computer communication switching techniqueComputer Networks (1976), 1979
- Some Deadlock Properties of Computer SystemsACM Computing Surveys, 1972