Abstract
This paper is part of a continued investigation of the relative power of different variants of the CRCW PRAM with infinite global memory. The models that we consider are the standard Priority and Common PRAMs, together with the less well-known Collision + and Tolerant PRAMs. We describe several new results for the simulation of an n-processor Priority PRAM on weaker machines:
-
(1)
on an n-processor Tolerant PRAM: Slowdown \(O\left( {\sqrt {log{\text{ }}n} } \right)\);
-
(2)
on an n-processor Collision + PRAM: Slowdown O(log log n log(3) n);
-
(3)
on a Common PRAM with kn processors (k≤log n/2): Slowdown O(log n/(k log(log n/k)));
-
(4)
on a Tolerant PRAM with kn processors (2≤k≤log n): Slowdown O(log n/log k);
-
(5)
on a randomized n-processor Collision + PRAM: Expected slowdown O(log log n).
Supported by the Deutsche Forschungsgemeinschaft, SFB 124, TP B2, VLSI Entwurfsmethoden und Parallelität.
Part of the research was carried out while the author was at Instytut Informatyki, Uniwersytet Warszawski.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B. S. Chlebus, K. Diks, T. Hagerup and T. Radzik: “Efficient Simulations between Concurrent-Read Concurrent-Write PRAM Models”. 13th Symposium on Mathematical Foundations of Computer Science (1988), Springer Lecture Notes in Computer Science 324, 231–239.
F. E. Fich, P. Ragde and A. Wigderson: “Relations Between Concurrent-Write Models of Parallel Computation”. SIAM Journal on Computing 17 (1988), 606–627.
F. E. Fich, P. Ragde and A. Wigderson: “Simulations Among Concurrent-Write PRAMs”. Algorithmica 3 (1988), 43–51.
L. M. Goldschlager: “A Universal Interconnection Pattern for Parallel Computers”. Journal of the ACM 29 (1982), 1073–1086.
V. Grolmusz and P. Ragde: “Incomparability In Parallel Computation”. Proceedings, 28th Annual Symposium on Foundations of Computer Science (1987), 89–98.
L. Kučera: “Parallel Computation and Conflicts in Memory Access”. Information Processing Letters 14 (1982), 93–96.
M. Li and Y. Yesha: “Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation”. Information and Computing 73 (1987), 102–128.
P. Ragde, personal communication, 1988.
P. Ragde, W. Steiger, E. Szemerédi and A. Wigderson: “The Parallel Complexity of Element Distinctness is Ω(√log n)”. SIAM Journal on Discrete Mathematics 1 (1988), 399–410.
Y. Shiloach and U. Vishkin: “An O(log n) Parallel Connectivity Algorithm”. Journal of Algorithms 3 (1982), 57–67.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chlebus, B.S., Diks, K., Hagerup, T., Radzik, T. (1989). New simulations between CRCW PRAMs. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-51498-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51498-5
Online ISBN: 978-3-540-48180-5
eBook Packages: Springer Book Archive