Abstract
Upper bounds are derived for the processor—time tradeoffs of machines such as linear arrays and two-dimensional meshes, which are compatible with the physical limitation expressed by bounded-speed propagation of messages (due to the finiteness of the speed of light). It is shown that parallelism and locality combined may yield speedups superlinear in the number of processors. The speedups are inherent, due to the optimality of the obtained tradeoffs as established in a companion paper.
Simulations of multiprocessor machines are developed by analogous machines with fewer processors. A crucial role is played by the hierarchical nature of the memory system. A divide-and-conquer technique for hierarchical memories is developed, based on the graph-theoretic notion of a topological separator. For multiprocessors, this technique also requires a careful balance of memory access and interprocessor communication costs, which leads to nonintuitive orchestrations of the simulation process.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received November 2, 1995, and in final form September 12, 1996.
Rights and permissions
About this article
Cite this article
Bilardi, G., Preparata, F. Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. Theory Comput. Systems 30, 523–546 (1997). https://doi.org/10.1007/s002240000066
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002240000066