An Optimistic Deadlock Free Adaptive Wormhole Routing Algorithm for Two Dimensional Meshes.
R.S. Rajesh, S. Arumugam · Communications in Computing · 2004
This paper proposes a general scheme for deadlock recovery based adaptive wormhole routing by considering a minimal set of additional buffers called recovery buffers. This scheme is then applied to deadlock recovery. When deadlock occurs in adaptive wormhole routing, the scheme routes the deadlocked message through a special recovery network, constructed from a sub set of the available network resources. Safe recovery is performed without loosing the adaptivity in routing. Simulation study revealed that the proposed scheme performs well under high network load.