22nd Annual International Symposium on Computer Architecture (ISCA'95)
An Efficient, Fully Adaptive Deadlock Recovery Scheme: DISHA
S. Margherita Ligure, Italy
June 22-June 24
ISBN: 0-89791-698-0
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.
Citation:
Timothy Mark Pinkston, K. V. Anjan, "An Efficient, Fully Adaptive Deadlock Recovery Scheme: DISHA," isca, pp.201, 22nd Annual International Symposium on Computer Architecture (ISCA'95), 1995
Usage of this product signifies your acceptance of the
Terms of Use.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||