Abstract
This paper presents a deadlock recovery based fully adaptive routing for any interconnection network topology. The routing is simple, adaptive and is based on calculating the probabilities of routing at each node to neighbors, depending upon the static and dynamic conditions of the network. The probability of routing to the i th neighbor at any node is a function of the traffic and distance from the neighbor to the destination. Since with our routing algorithm deadlocks are rare, deadlock recovery is a better solution. We also propose here two deadlock recovery schemes. Since deadlocks occur due to cyclic dependencies, these cycles are broken by allowing one of the messages involved in deadlock to take an alternate path consisting of buffers reserved for such messages. These buffers can be centralized buffers accessible to all neighboring nodes or can be set of virtuals. The performance of our algorithm is compared with other recently proposed deadlock recovery schemes. The 2-Phase routing is found to be superior compared to the other schemes in terms of network throughput and mean delay.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
K.V.Anjan and T.M.Pinkston, ”Disha: A deadlock Recovery Scheme for Fully Adaptive Routing”, Proc. of the 19th Int. Parallel Processing Symposium, 1995.
A.A. Chien, ”A Cost and Speed Model for k-ary n-cube Wormhole Routers”, IEEE Transactions on Parallel and Distributed Systems, Vol.9, No.2, pages 150–162, 1998.
W. Dally and H. Aoki, ”Deadlock-free Adaptive Routing in Multicomputer Networks using Virtual Channels”, IEEE Transactions on Parallel and Distributed Systems, Vol.4, No.4,1993, pages 466–475.
W. Dally and C. Seitz, “Deadlock-free message routing in multiprocessor interconnection networks”, IEEE Transactions on Computers, C-36(5), 1987, pages 547–553.
C.J.Glass and L.M.Ni, ”The turn model for Adaptive routing”, Proc. of the 19th Int. Symp. on Comp. Architecture, 1992, pages 278–287.
J. Kim, Z. Liu and A. Chien, “Compressionless Routing: A Framework for Adaptive and Fault-tolerant Routing”, IEEE Transactions on Parallel and Distributed Systems, Vol.8, No.3, pages 229–244, 1997.
X. Lin, P.K. McKinley and L.M. Ni, “Deadlock-free multicast wormhole routing in 2D mesh multicomputers”, IEEE Trans. on Parallel and Distributed Systems, Vol.5, no.8, 1994, pages 793–804.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrawal, N., Ravikumar, C.P. (1998). Adaptive routing based on deadlock recovery. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057957
Download citation
DOI: https://doi.org/10.1007/BFb0057957
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive