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]
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Y. Lee, “An algorithm for path connections and its applications,” IRE Trans. Electronic Computers, Vol. EC-10, pp. 346–365, Sept. 1961.
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.
Y. Saad and M. Schultz, ”Topological properties of hypercubes,” Research Report, YALEU/DCS/RR-389, Computer Science Dept., Yale University, Jun. 1985.
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.
Author information
Authors and Affiliations
Editor information
Rights 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