Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds

@article{Bilardi1997ProcessorTimeTU,
  title={Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds},
  author={Gianfranco Bilardi and Franco P. Preparata},
  journal={Theory of Computing Systems},
  year={1997},
  volume={32},
  pages={531-559}
}
Lower bounds are developed for the processor—time tradeoffs of machines such as linear arrays and two-dimensional meshes, which are compatible with the physical limitation on propagation speed of messages. The machines we consider are characterized by the property that identical numbers of simultaneous memory accesses, operations, and message communications are expressed by the number of processors. For this class of machines, a class of computations is analyzed for which parallelism and… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
17 Citations
1 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…