Abstract
We describe a deterministic simulation of PRAMs on module parallel computers (MPCs) and on processor networks of bounded degree. The simulating machines have the same number n of processors as the simulated PRAM, and if the size of the PRAM's shared memory is polynomial in n, each PRAM step is simulated by O(log n) MPC steps or by O((log n)2) steps of the bounded degree network. This improves upon a previous result by Upfal and Wigderson. We also prove an Ω((log n)2/log log n) lower bound on the number of steps needed to simulate one PRAM step on a bounded degree network under the assumption that the communication in the network is point-to-point.
Part of the research was done while the author was a member of the Mathematical Sciences Research Institute, Berkeley, U.S.A.
This work was supported by the DFG, SFB 124, TP B2, VLSI Entwurf und Parallelität, and by NSF Grant ECS-84-10902.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, J. Komlós, E. Szemerédi: “An O(n log n) Sorting Network”. Proc. 15'th ACM Symp. Theory of Comp. (1983), 1–9.
A. Borodin, J. E. Hopcroft: “Routing, Merging and Sorting on Parallel Models of Computation”. Proc. 14'th ACM Symp. Theory of Comp. (1982), 338–344.
S. Fortune, J. Wyllie: “Parallelism in Random Access Machines”. Proc. 10'th ACM Symp. Theory of Comp. (1978), 114–118.
O. Gabber, Z. Galil: “Explicit Constructions of Linear Size Concentrators and Superconcentrators”. Proc. 20'th Conf. Foundations of Comp. Sci. (1979), 364–370.
D. J. Kuck: “A Survey of Parallel Machine Organization and Programming”. Computing Surveys 9:1 (1977), 29–59.
A. R. Karlin, E. Upfal: “Parallel Hashing — An Efficient Implementation of Shared Memory”. Proc. 18'th ACM Symp. Theory of Comp. (1986), to appear.
T. Leighton: “Tight Bounds on the Complexity of Parallel Sorting”. Proc. 16'th ACM Symp. Theory of Comp. (1984), 71–80.
K. Mehlhorn, U. Vishkin: “Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories”. Acta Informatica 21 (1984), 339–374.
E. Upfal: “A Probabilistic Relation Between Desirable and Feasible Models of Parallel Computation”. Proc. 16'th ACM Symp. Theory of Comp. (1984), 258–265.
E. Upfal, A. Wigderson: How to Share Memory in a Distributed System”. Proc. 25'th Conf. Foundations of Comp. Sci. (1984), 171–180.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alt, H., Hagerup, T., Mehlhorn, K., Preparata, F.P. (1986). Deterministic simulation of idealized parallel computers on more realistic ones. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016243
Download citation
DOI: https://doi.org/10.1007/BFb0016243
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive