Maze routing on a hypercube multicomputer |
| |
Authors: | Youngju Won Sartaj Sahni |
| |
Affiliation: | (1) Computer Science Department, 136 Lind Hall, University of Minnesota, 55455 Minneapolis, MN, USA |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|