An efficient, fully adaptive deadlock recovery scheme
- 1 May 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 23 (2) , 201-210
- https://doi.org/10.1145/225830.224431
Abstract
This paper presents a simple, efficient and cost effective routing strategy that considers deadlock recovery as opposed to prevention. Performance is optimized in the absence of deadlocks by allowing maximum flexibility in routing. Disha supports true fully adaptive routing where all virtual channels at each node are available to packets without regard for deadlocks. Deadlock cycles, upon forming, are efficiently broken by progressively routing one of the blocked packets through a deadlock-free lane. This lane is implemented using a central "floating" deadlock buffer resource in routers which is accessible to all neighboring routers along the path. Simulations show that the Disha scheme results in superior performance and is extremely simple, ensuring quick recovery from deadlocks and enabling the design of fast routers.Keywords
This publication has 13 references indexed in Scilit:
- Adaptive routing protocols for hypercube interconnection networksComputer, 1993
- 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
- Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networksPublished by Association for Computing Machinery (ACM) ,1992
- Virtual-channel flow controlIEEE Transactions on Parallel and Distributed Systems, 1992
- Planar-adaptive routingPublished by Association for Computing Machinery (ACM) ,1992
- The turn model for adaptive routingPublished by Association for Computing Machinery (ACM) ,1992
- An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubesIEEE Transactions on Computers, 1991
- Chaos routerPublished by Association for Computing Machinery (ACM) ,1991
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987