Skip to main content
SpringerLink
Log in

A deadlock free routing algorithm with network size independent buffering space

  • Communication Issues
  • Conference paper
  • First Online:
CONPAR 90 — VAPP IV (VAPP 1990, CONPAR 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 457))

Abstract

The purpose of this paper is to describe the theory behind a correct routing function suitable for parallel machines composed of networks of asynchronous processors. We propose a new deadlock free routing function which avoids the drawbacks of existing methods based on buffers ordering. The algorithm is based on a protocol which insures the correct delivery of messages at their destination in networks of even degree. A few restrictions are considered for the calculus of routes in the network. Under such restrictions, messages are routed through the shortest paths and never cross the same route. The buffer space required is independent of the size of the network. The routing function gives all the valid paths between any two nodes, thus adaptive routing can be envisaged in order to achieve load balancing.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Kermani, L. Kleinrock:Virtual cut-through: A new computer communication switching technique; Computers Networks no3 1976.

    Google Scholar 

  2. W. J. Dally, C. L. Seitz:Deadlock-free message routing in multiprocessor interconnection networks; IEEE Trans. on Comp. Vol c36 1987.

    Google Scholar 

  3. M. Gerla, L. Kleinrock:Flow control: A comparative survey; IEEE Transactions on Communications Vol com 28 no4 1980.

    Google Scholar 

  4. C. W. Chan, T. S. P. Yum:An algorithm for detecting and resolving Store and Forward deadlocks in Packet-Switching networks; IEEE Transactions on Communications Vol 35 no8

    Google Scholar 

  5. I. Cidon, J.M. Jaffe, M. Sidi:Distributed Store and Forward deadlock detection and resolution algorithm; IEEE Trans. on Comm. Vol com 35 1987.

    Google Scholar 

  6. W. J. Dally, C. L. Seitz:The torus routing chip; Distributed Comp. 1986.

    Google Scholar 

  7. J. K. Annot, R. A. H. Van Twist:A novel deadlock free and starvation free packet switching communication processor; LNCS no 258 juin 1987.

    Google Scholar 

  8. P. Merlin, P. Schweitzer:Deadlock avoidance in Store and Forward networks; IEEE Transactions on Communications Vol com 28 no3 1980.

    Google Scholar 

  9. E. Ranbold, J. Handle:A method of deadlock-free ressource allocation and flow control in packets networks; Proc Int Conf Comp Comm Toronto, 1976.

    Google Scholar 

  10. P. A. J. Hilbers, J. J. Lukkien:Deadlock-free message routing in processor networks; Univ of Groningen, 1988.

    Google Scholar 

  11. I. S. Gopal:Prevention of Store and Forward deadlock in computer networks; IEEE Transactions on Communications Vol com 33 no12 1985.

    Google Scholar 

  12. A. V. Aho, J. E. Hopcroft, J. D. Ullman:The design and analysis of computer algorithms; Addison-Wesley, 1974

    Google Scholar 

  13. F. Moller:A survey of systolic systems for solving algebraic path problem; CS-85-Univ of Waterloo Computer Science Dpt, 1985.

    Google Scholar 

  14. I. Sakho, M. Tchuenté:Méthode de conception d'algorithmes parallèles pour réseaux réguliers; TSI vol. 8 no1 1989.

    Google Scholar 

  15. C. Berge: Théorie des graphes, Gauthier-Villars, 1983

    Google Scholar 

  16. B. Gavish, P. M. Merlin, P. J. Schweitzer:Minimal Buffer Requirements for avoiding Store-and-Forward Deadlock; PRC 6672 (#28754) IBM Thomas J. Watson research center, Yorktown, 1977

    Google Scholar 

  17. J. Briat, M. Favre, N.Gonzalez, Y.Langué, T. Muntean, Ph. WaillePARX: A Parallel Operating System for transputer based machines; "10th O U G on Applying Transputer based parallel machines", (ed. A. Bakkers) IOS-Amsterdam, 1989

    Google Scholar 

  18. D.A. Nicole, E.K. Lloyd, J.S. Ward: Switching networks for transputer links; "8 th O.U.G on Developments using OCCAM", (ed. A. Kerridge) IOS-Amsterdam, 1988

    Google Scholar 

  19. Esprit Projects P1085 &P2528: SUPERNODE

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Imag/Laboratoire de Génie Informatique, University of Grenoble, BP. 53X, F-38041, Grenoble

    Léon Mugwaneza, Traian Muntean & Ibrahima Sakho

Authors
  1. Léon Mugwaneza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Traian Muntean
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ibrahima Sakho
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Helmar Burkhart

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mugwaneza, L., Muntean, T., Sakho, I. (1990). A deadlock free routing algorithm with network size independent buffering space. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_127

Download citation

  • DOI: https://doi.org/10.1007/3-540-53065-7_127

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53065-7

  • Online ISBN: 978-3-540-46597-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation