Skip to main content
SpringerLink
Log in

Parallelization of Lee's routing algorithm on a hypercube multicomputer

  • Applications
  • 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

Lee's maze routing algorithm is parallelized and implemented on an Intel iPSC/2 hypercube multicomputer. Our contribution to the previous work in [2] is that we propose a new parallel front wave expansion scheme which performs two front wave expansions concurrently, one starting from the source cell and the other one starting from the target cell. The proposed scheme increases the processor utilization and decreases the total number of interprocessor communications. We experimentally show that our scheme outperforms the scheme given in [2]

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. C. Y. Lee, “An algorithm for path connections and its applications,” IRE Trans. Electronic Computers, Vol. EC-10, pp. 346–365, Sept. 1961.

    Article  MathSciNet  Google Scholar 

  2. Youngju Won and Sartaj Sahni, “Maze Routing On a Hypercube Multiprocessor Computer,” Proceedings of Intrl. Conf. on Parallel Processing, St.Charles August 1987, pp. 630–637.

    Google Scholar 

  3. Y. Saad and M. Schultz, ”Topological properties of hypercubes,” Research Report, YALEU/DCS/RR-389, Computer Science Dept., Yale University, Jun. 1985.

    Google Scholar 

  4. T. M. Kurç, C. Aykanat, and F. Erçal, ”Maze Routing on an iPSC/2 Hypercube Multi-computer.”, Proceedings of ISCIS V, Nevşehir, Turkey, Oct. 1990, pp. 327–336.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering & Science, Department of CIS, Bilkent University, 06533, Bilkent, Ankara, Turkey

    Tahsin M. Kurç, Cevdet Aykanat & Fikret Erçal

Authors
  1. Tahsin M. Kurç
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cevdet Aykanat
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fikret Erçal
    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

Kurç, T.M., Aykanat, C., Erçal, F. (1991). Parallelization of Lee's routing algorithm on a hypercube multicomputer. In: Bode, A. (eds) Distributed Memory Computing. EDMCC 1991. Lecture Notes in Computer Science, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032941

Download citation

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

  • 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