A COST EFFECTIVE DEADLOCK RECOVERY SCHEME FOR ADAPTIVE WORMHOLE ROUTED NETWORKS

Authors

  • JAMEEL AHMAD , PROF A.A. ZILLI , DR. MOHD. RIZWAN BEG , DR. SHISH AHMAD CSE Department, Integral University, Lucknow, India

Keywords:

Computer Architecture, Wormhole routing, flit buffer, multicomputer, Mesh Network, Cost effective.

Abstract

Efficient, cost effective and deadlock free routing of messages is crucial for the performance of directly connected network systems. Nodes of directly connected multicomputer systems communicate via message exchange. The wormhole routing has been proved the best switching technique in directly connected systems. The technique faces the challenges like flow control and deadlock avoidance. Deadlock avoidance is the key challenge in wormhole networks. Deadlock recovery is an alternative but on the cost of implications of deadlock detection mechanism and additional resources. The proposed work is an attempt to device a cost effective, efficient mechanism for deadlock recovery with fewer resources to optimize cost, and with reduced complexity to enhance performance.

References

Prashant Mohapatra, “Wormhole Routing Techniques for Directly Connected Multicomputer Systems”201 Cover Hall, Lowa State University Ames, IA 50011.

K. V. Anjan and T. M. Pinkston, “An efficient fully adaptive deadlock recovery Scheme: DISHA, Int. Symp. On Computer Architecture, PP. 201-210, June 1995.

L. M. Ni and P. K. McKinley, “A survey of Wormhole Routing Technique in Direct networks”, IEEE Computers, vol.26, no.2, pp. 62-76, Feb. 1993.

C. J. Glass and L.M. Ni, “The Turn model for adaptive routing,” Jou. Of the ACM, pp.874-902, vol. 41, Sept. 1994.

Andrew A. Chien. A cost and performance model for k-ary n-cube wormhole routers. In Proceedngs of Hot Interconnects Workshop. August 1993.

J. Duato. On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies. In Proceedings of Parallel Architectures and Languages Erope, pages 390-405, June 1991.

J. D. Allen et al. Ariadne*--An Adaptive Router for Fault –tolerant Multicomputers. In Proceedings of the 21st Annual International Symposium on Computer Architecture, IEEE Computer Society, pages 278-288, April, 1994.

Andrew A. Chien and J. H. Kim. Planner-adaptive routing: Low-cost Adaptive networks for multiprocessors. In Proceedings of the 19th International Symposium on Computer Architecture, IEEE Computer Society, 268-77, May,1992.

W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5), pages 547-553, May, 1987.

W. Dally, virtual channel flow control. IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No. 4

Downloads

Published

2014-10-31

Issue

Vol. 3 No. 11 (2014): October 2014 With Best Paper of Issue

Section

Articles

License

Copyright Notice

Submission of an article implies that the work described has not been published previously (except in the form of an abstract or as part of a published lecture or academic thesis), that it is not under consideration for publication elsewhere, that its publication is approved by all authors and tacitly or explicitly by the responsible authorities where the work was carried out, and that, if accepted, will not be published elsewhere in the same form, in English or in any other language, without the written consent of the Publisher. The Editors reserve the right to edit or otherwise alter all contributions, but authors will receive proofs for approval before publication.

Copyrights for articles published in World Scholars journals are retained by the authors, with first publication rights granted to the journal. The journal/publisher is not responsible for subsequent uses of the work. It is the author's responsibility to bring an infringement action if so desired by the author.