Skip to main content
SpringerLink
Log in

Deadlock-free adaptive routing algorithms for the 3D-torus: Limitations and solutions

  • Poster Session
  • Conference paper
  • First Online:
PARLE '93 Parallel Architectures and Languages Europe (PARLE 1993)

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

Abstract

In this paper, a deadlock-free adaptive routing algorithm, obtained from the application of the theory proposed in [4] to the 3D-torus, is evaluated under different load conditions and compared with other algorithms. The results show that this algorithm is very fast, also increasing the network throughput considerably. Nevertheless, this adaptive algorithm has cycles in its channel dependency graph. As a consequence, when the network is heavily loaded messages may temporarily block cyclically, drastically reducing the performance of the algorithm. Two mechanisms are proposed to avoid this problem.

This work was supported in part by CICYT under grant number TIC91-1157-C03-03

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. A. Agarwal, Limits on interconnection network performance, IEEE Trans. Parallel and Distributed Systems, Vol. 2, No. 4, pp. 398–412, October 1991.

    Google Scholar 

  2. W.J. Dally, Virtual-channel flow control, IEEE Trans. Parallel and Distributed Systems, Vol. 3, No. 2, pp. 194–205, March 1992.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. J. Duato, On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies, Proc. PARLE'91, June 1991.

    Google Scholar 

  5. J. Duato, Improving the efficiency of virtual channels with time-dependent selection functions, Proc. PARLE'92, June 1992.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. de Ingeniería de Sistemas, Computadores y Automática Facultad de Informática, Universidad Politécnica de Valencia, P.O.B. 22012, 46071, Valencia, Spain

    Pedro López & José Duato

Authors
  1. Pedro López
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Duato
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode Mike Reeve Gottfried Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

López, P., Duato, J. (1993). Deadlock-free adaptive routing algorithms for the 3D-torus: Limitations and solutions. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-56891-3_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56891-9

  • Online ISBN: 978-3-540-47779-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation