Abstract
In this paper we present lower and upper bounds for the deterministic emulation of a Parallel Random Access Machine (PRAM) with n processors and m variables on a Distributed Memory Machine (DMM) with n processors. The bounds are expressed as a function of the redundancy r of the scheme (i.e., the number of copies used to represent each PRAM variable in the DMM), and become tight for any m polynomial in n and r=Θ(1).
This research was supported in part by the ESPRIT Basic Research Project 9072 GEPPCOM: Foundations of GEneral Purpose Parallel COMputing.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Alt, T. Hagerup, K. Mehlhorn, and F.P. Preparata. Deterministic simulation of idealized parallel computers on more realistic ones. SIAM Journal on Computing, 16(5):808–835, 1987.
M. Dietzfelbinger and F. Meyer auf der Heide. Simple, efficient shared memory simulations. Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, pages 110–118, 1993.
K.T. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded degree networks. SIAM Journal on Computing, 1994. To appear. (See also Proceedings of the 26th Annual Allerton Conference on Communication, Control and Computation, pages 1084–1093, 1988.)
K.T. Herley. Efficient simulations of small shared memories on bounded degree networks. Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 390–395, 1989.
R. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM simulation on distributed machines. Proceedings of the 24th ACM Symposium on Theory of Computing, pages 318–326, 1992.
A.R. Karlin and E. Upfal. Parallel hashing: An efficient implementation of shared memory. Journal of the ACM, 35(4):876–892, 1988.
F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmica, 5:529–544, 1990.
K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 9(1):29–59, 1984.
A. Pietracaprina and F.P. Preparata. An O(√n)-worst-case-time solution to the granularity problem. Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science, LNCS 665:110–119, 1993.
A. Pietracaprina and F.P. Preparata. A practical constructive scheme for deterministic shared-memory access. Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, pages 100–109, 1993.
A. Pietracaprina, G. Pucci, and J.F. Sibeyn. Constructive deterministic PRAM simulation on a mesh-connected computer. Proceedings of the 6th ACM Symposium on Parallel Algorithms and Architectures, 1994. To appear.
E. Upfal and A. Widgerson. How to share memory in a distributed system. Journal of the ACM, 34(1):116–127, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pietracaprina, A., Pucci, G. (1994). Tight bounds on deterministic PRAM emulations with constant redundancy. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049425
Download citation
DOI: https://doi.org/10.1007/BFb0049425
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58434-6
Online ISBN: 978-3-540-48794-4
eBook Packages: Springer Book Archive