A Cost Effective and Performance Enhanced Deadlock Recovery Scheme for Wormhole Routed Networks

  • Jameel Ahmad
  • Akheela Khanum
  • A. A. Zilli
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 624)


Directly connected multicomputer systems provide massively high computational capacity when connected with an interconnection network, having their own components as local memory, processor and other peripheral devices and connected with some topology as mesh, hypercube, and tree [1]. These nodes communicate with each other by exchanging messages. Each node equipped with a router which deals with communication-related implications [2]. Various switching techniques are used to route the messages from source to destination node. The wormhole routing technique has been proved as most suitable switching technique in these systems [3], but faces challenges like flow control and deadlocks (Mohapatra in Wormhole routing techniques for directly connected multicomputer systems [4]). There are two common approaches to deadlock handling: deadlock detection and deadlock recovery. The proposed work is based on deadlock recovery. This is based on the existing scheme ‘Disha’ (Anjan and Pinkston in An efficient fully adaptive deadlock recovery scheme: DISHA, pp. 201–210 (1995) [5]). Full adaptive routing is allowed without any restriction, and a deadlock detection mechanism is applied to monitor the deadlocks, and if deadlock is detected, then a deadlock recovery mechanism is in place to resolve the deadlock cycles. To optimize the cost the proposed scheme suggests, not equipping every node with additional buffer but alternate nodes in the columns of a mesh can be equipped with additional flit buffer, and blocked packets can switch to the recovery path, and eventually reach to the destination. So enhanced performance is achieved on reduced complexity and optimized cost.


Wormhole switching Adaptive routing Recovery path Deadlock buffer 


  1. 1.
    C. J. Glass and L. M. Ni, Adaptive Routing in mesh-connected networks, Intl. Conference on Distributed Computing Systems, pp. 12–19, 1992.Google Scholar
  2. 2.
    J.-H. Seo, (2013) “Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers”, Journal of Supercomputing, Vol. 64, No. 3, pp 987–1007.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    Prasant Mohapatra, “Wormhole Routing Techniques for Directly Connected Multicomputer Systems” 201 Cover Hall, Lowa State University Ames, IA 50011.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    Amnah EL-Obaid, (2015), Three Dimension Hamiltonian Broadcast Wormhole- Routing, Vol 7, No. 3, May 2015, International Journal of Computer Networks and Communication(ICNC), Department of Computer Science and Information, Technology, Al-Zaytoonah University of Jordon, Amman Jordon.Google Scholar
  7. 7.
    J. Duato. On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies. In Proceedings of Parallel Architecture and Languages Europe, pages 390–405, June, 1991.Google Scholar
  8. 8.
    J. Duato. A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks. In Proceedings of the International Conference on Parallel Processing, pages I142–I149, August, 1994.Google Scholar
  9. 9.
    Andrew A. Chien. A Cost and performance model for k-ary n-cube wormhole routers. In Proceedings of Hot Interconnects Workshop, August 1993.Google Scholar
  10. 10.
    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, pages 268–77, May, 1992.Google Scholar
  11. 11.
    J. Kim, Z. Liu and A. Chien. Compressionless Routing: A framework for adaptive and fault-tolerant routing. In Proceedings of the 21st International Symposium on Computer Architecture, IEEE Computer Society, pages 289–300, April, 1994.Google Scholar
  12. 12.
    Faizal Arya Samman, (2011) “New Theory for Deadlock-Free Multicast Routing in Wormhole-Switched Virtual Chanel less Networks on-chip”, IEEE Transactions on Parallel & Distributed System, Vol. 22, pp 544–557.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    J. Duato, C. Yalamanchili, L. Ni, (2003) “Interconnection Networks: An Engineering Approach”, Elsevier Science.Google Scholar
  15. 15.
    C. J. Glass and L. M. Ni, “The Turn model for adaptive routing,” Jou. of the ACM, pp. 874–902, vol. 41, Sept. 1994.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringIntegral University LucknowLucknowIndia

Personalised recommendations