Abstract
We give several simple and efficient algorithms for simulations of stronger CRCW PRAMs on weaker ones. The models that we consider are the well-known PRIORITY, ARBITRARY and COMMON PRAMs, and COLLISION and COLLISION+, defined by the property that a special collision symbol is stored in each memory cell into which more than one processor attempts to write, or more than one value is attempted to be written, respectively, in a given step. Our results are the following, where n denotes the number of processors of the simulated PRAM:
-
1)
A O(1)-time simulation between any pair of models, provided that the simulating machine has O(n log n) processors;
-
2)
Two n-processor simulations: of PRIORITY on ARBITRARY with O(loglog n) slowdown, and of PRIORITY on COLLISION+ with O((loglog n)2) slowdown.
Preview
Unable to display preview. Download preview PDF.
References
F.E. Fich, F. Meyer auf der Heide, and A. Wigderson, Lower bounds for parallel random-access machines with unbounded shared memory, Advances in Computing Research, 1986.
F.E. Fich, P.L. Ragde, and A. Wigderson, Relations between concurrent-write models of parallel computation, in Proceedings, 3rd Annual ACM Symposium on Principles of Distributed Computing, 1984, pp. 179–189 (to appear in SIAM J. Computing)
F.E. Fich, P.L. Ragde, and A. Wigderson, Simulations among concurrent-write PRAMs, manuscript, 1986, to appear in Algorithmica.
S. Fortune, and J. Wyllie, Parallelism in random access machines, in Proceedings, 10th Annual ACM Symposium on Theory of Computing, San Diego, Calif., 1978, pp. 114–118.
L. Goldschlager, A universal interconnection pattern for parallel computers, J. ACM 29 (1982), 1073–1086.
V. Grolmusz, and P.L. Ragde, Incomparability in parallel computation, in Proceedings, 28th Annual IEEE Symposium on Foundations of Computer Science, 1987, pp. 89–98.
L. Kučera, Parallel computation and conflicts in memory access, Information Processing Letters 14 (1982), 93–96.
M. Li, and Y. Yesha, New lower bounds for parallel computation, in Proceedings, 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 177–187.
P. L. Radge, A. Szemeredi, W. Steiger, and A. Widgerson, The parallel complexity of element distinctness is Щ(√log n), manuscript, 1986. (submitted to SIAM J. of Discrete Mathematics).
Y. Shiloach, and U. Vishkin, An O(log n) parallel connectivity algorithm, J. Algorithms 3 (1982), 57–63.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chlebus, B.S., Diks, K., Hagerup, T., Radzik, T. (1988). Efficient simulations between concurrent-read concurrent-write pram models. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017146
Download citation
DOI: https://doi.org/10.1007/BFb0017146
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive