Abstract
The implementation of Lee's maze routing algorithm on an MIMD hypercube multiprocessor computer can follow several plausible mappings and synchronization strategies. These are evaluated experimentally on an NCUBE/7 hypercube computer with 64 processors. Different grid partitioning and mapping strategies result in a different balance between computation and communication time. The total routing time is significantly impacted by the synchronization and termination detection scheme used. Further, by rearranging the computation, it is possible to overlap much of the interprocessor communication with the computation and realize a significant reduction in the overall run time. By choosing the right partitioning and synchronization scheme and by overlapping computation and communication, a good speedup is obtained on large routing grids.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blank, T., Stefik, M., and vanCleemput, W. 1981. A parallel bit map processor architecture for DA algorithms. InConference Proceedings—The 18th Design Automation Conference, ACE/IEEE, pp. 837–845.
Dunigan, T.H. 1987. Hypercube performance. InConference Proceedings—Hyper cube Multiprocessors 1987 (Knoxville, Sept. 29–Oct. 1, 1986), SIAM, pp. 178–192.
Iosupovici, A. 1986. A class of array architectures for hardware grid routers.IEEE Trans. CAD, CAD-5,2 (Apr.), 245–255.
Mudge, T.N., Ratenbar, R.A., Lougheed, R.M., and Atkins, D.E. 1982. Cellular image processing techniques for VLSI circuit layout validation and routing. InConference Proceedings—The 19th Design Automation Conference, ACE/IEEE, pp. 537–543.
Nair, R., Hong, S.J., Liles, S., and Villani, R. 1982. Global wiring on a wire routing machine. InConference Proceedings—The 19th Design Automation Conference, ACE/IEEE, pp. 224–231.
Palmer, J., Colley, S., Hayes, J.P., Mudge, T.N., and Stout, Q.F. 1986. Architecture of a hypercube supercomputer. InConference Proceedings—International Conference on Parallel Processing, Pennsylvania State University, pp. 653–660.
Saad, Y., and Schultz, M.H. 1985. Topological properties of hypercubes.Technical report YALE/DCS/RR-389, Dept. of Computer Science, Yale University.
Suzuki, K., Matsunaga, Y., Tachibana, M., and Ohtsuki, T. 1986. A hardware maze router with application to interactive rip-up and reroute.IEEE Trans. CAD, CAD-5,4 (Oct.), 466–476.
Won, Y.J., Sahni, S., and El-Ziq, Y. 1987. A hardware accelerator for maze routing. InConference Proceedings—The 24th Design Automation Conference, ACE/IEEE, pp. 800–807.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Won, Y., Sahni, S. Maze routing on a hypercube multicomputer. J Supercomput 2, 55–79 (1988). https://doi.org/10.1007/BF00127848
Issue Date:
DOI: https://doi.org/10.1007/BF00127848