Skip to main content
SpringerLink
Log in

On the design of deadlock-free adaptive routing algorithms for multicomputers: Theoretical aspects

  • Interconnection Problems
  • Conference paper
  • First Online:
Distributed Memory Computing (EDMCC 1991)

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

Included in the following conference series:

Abstract

Second generation multicomputers use wormhole routing, drastically reducing the dependency between network latency and internode distance. Deadlock-free routing strategies have been developed, allowing the implementation of fast hardware routers. Also, adaptive routing algorithms with deadlock-avoidance or deadlock-recovery techniques have been proposed for some topologies, being very effective and outperforming static strategies.

This paper develops the theoretical aspects for the design of deadlock-free adaptive routing algorithms. Some basic definitions and three theorems are proposed, developing conditions to verify that an adaptive algorithm is deadlock-free, even when there are cycles in the channel dependency graph. As an example, a new adaptive algorithm for 2D-meshes is presented.

This research is supported by CICYT grant number TIC 87-0655

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.C. Athas and C.L. Seitz, Multicomputers: message-passing concurrent computers, Computer, Vol. 21, No. 8, pp. 9–24, August 1988.

    Article  Google Scholar 

  2. S. Borkar et al., iWarp: an integrated solution to high-speed parallel computing, Supercomputing '88, Kissimmee, Florida, November 1988.

    Google Scholar 

  3. W. Chou, A.W. Bragg and A.A. Nilsson, The need for adaptive routing in the chaotic and unbalanced traffic environment, IEEE Trans. Commun., Vol. COM-29, No. 4, pp. 481–490, April 1981.

    Article  Google Scholar 

  4. E. Chow, H. Madan, J. Peterson, D. Grunwald and D.A. Reed, Hyperswitch network for the hypercube computer, Proc. 15th Int. Symp. Computer Architecture, Honolulu, May–June 1988.

    Google Scholar 

  5. W.J. Dally, A VLSI architecture for concurrent data structures, Kluwer Academic Publishers, 1987.

    Google Scholar 

  6. W.J. Dally, Virtual-channel flow control, Proc. 17th Int. Symp. Computer Architecture, Seattle, Washington, May 1990.

    Google Scholar 

  7. W.J. Dally, Performance analysis of k-ary n-cube interconnection networks, IEEE Trans. Computers, Vol. C-39, No. 6, pp. 775–785, June 1990.

    Article  MathSciNet  Google Scholar 

  8. W.J. Dally and C.L. Seitz, The torus routing chip, Distributed Computing, Vol. 1, No. 3, pp. 187–196, October 1986.

    Article  Google Scholar 

  9. W.J. Dally and C.L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Trans. Computers, Vol. C-36, No. 5, pp. 547–553, May 1987.

    Article  Google Scholar 

  10. J. Duato, Deadlock-free adaptive routing algorithms for multicomputers. Submitted to Tech. et Sci. Informatique.

    Google Scholar 

  11. D. Gelernter, A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks, IEEE Trans. Computers, Vol. C-30, pp. 709–715, October 1981.

    Article  Google Scholar 

  12. C. Germain-Renaud, Etude des mécanismes de communication pour une machine massivement parallèle: MEGA, Ph.D. dissertation, Université de Paris-Sud, Centre d'Orsay, 1989.

    Google Scholar 

  13. K.D. Gunther, Prevention of deadlocks in packet-switched data transport systems, IEEE Trans. Commun., Vol. COM-29, pp. 512–524, April 1981.

    Article  Google Scholar 

  14. W.D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.

    Google Scholar 

  15. C.R. Jesshope, P.R. Miller and J.T. Yantchev, High performance communications in processor networks, Proc. 16th Int. Symp. Computer Architecture, Jerusalem, Israel, May–June 1989.

    Google Scholar 

  16. P. Kermani and L. Kleinrock, Virtual cut-through: a new computer communication switching technique, Computer Networks, Vol. 3, pp. 267–286, 1979.

    MathSciNet  MATH  Google Scholar 

  17. C.K. Kim and D.A. Reed, Adaptive packet routing in a hypercube, Proc. 3rd Conf. on Hypercube Concurrent Computers & Applications, Pasadena, California, January 1988.

    Google Scholar 

  18. H.T. Kung, Deadlock avoidance for systolic communication, Proc. 15th Int. Symp. Computer Architecture, Honolulu, May–June 1988.

    Google Scholar 

  19. P.M. Merlin and P.J. Schweitzer, Deadlock avoidance in store-and-forward networks — I: Store-and-forward deadlock, IEEE Trans. Commun., Vol. COM-28, pp. 345–354, March 1980.

    Article  MathSciNet  Google Scholar 

  20. S. Ragupathy, M.R. Leutze and S.R. Schach, Message routing schemes in a hypercube machine, Proc. 3rd Conf. on Hypercube Concurrent Computers & Applications, Pasadena, California, January 1988.

    Google Scholar 

  21. D.S. Reeves, E.F. Gehringer and A. Chandiramani, Adaptive routing and deadlock recovery: a simulation study, Proc. 4th Conf. on Hypercube Concurrent Computers & Applications, Monterey, California, March 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultad de Informática, Universidad Politécnica de Valencia, P.O.B. 22012, 46071, Valencia, Spain

    J. Duato

Authors
  1. J. Duato
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duato, J. (1991). On the design of deadlock-free adaptive routing algorithms for multicomputers: Theoretical aspects. In: Bode, A. (eds) Distributed Memory Computing. EDMCC 1991. Lecture Notes in Computer Science, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032940

Download citation

  • DOI: https://doi.org/10.1007/BFb0032940

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53951-3

  • Online ISBN: 978-3-540-46478-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation