Abstract
We analyze the owner concept for PRAMs. In OROW-PRAMs each memory cell has one distinct processor that is the only one allowed to write into this memory cell and one distinct processor that is the only one allowed to read from it. By symmetric pointer doubling, a new proof technique for OROW-PRAMs, it is shown that list ranking can be done in O(log n) time by an OROW-PRAM and that LOGSPACE \(\subseteq\) OROW-TIME(log n). Then we prove that OROW-PRAMs are a fairly robust model and recognize the same class of languages when the model is modified in several ways and that all kinds of PRAMs intertwine with the NC-hierarchy without timeloss. Finally it is shown that EREW-PRAMs can be simulated by OREW-PRAMs and ERCW-PRAMs by ORCW-PRAMs.
This research was partially supported by the Deutsche Forschungsgemeinschaft, SFB 342, Teilprojekt A4 “Klassifikation und Parallelisierung durch Reduktionsanalyse”
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. K. Chandra, D. Kozen, and L. Stockmeyer. Alternation. J. ACM, 28:114–133, 1981.
S. A. Cook. A taxonomy of problems with fast parallel algorithms. Inform. and Control, 64:2–22, 1985.
S. A. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput., 15(1):87–97, 1986.
P. Dymond and W. L. Ruzzo. Parallel RAMs with owned global memory and deterministic language recognition. In Proc. of 13th ICALP, number 226 in LNCS, pages 95–104. Springer, 1987.
F. E. Fich. New bounds for parallel prefix circuits. In Proc. of 15th STOC, pages 27–36, 1983.
S. Fortune and J. Willie. Parallelism in random access machines. In Proc. of 10th STOC, pages 114–118, 1978.
R. M. Karp and V. Ramachandran. A survey of parallel algorithms for shared-memory machines. Technical Report UCB/CSD 88/408, Computer Science Division, University of California at Berkeley, California 94720, Mar. 1987. To appear in J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier.
R. E. Ladner and M. J. Fischer. Parallel prefix computation. J. ACM, 27:831–838, 1980.
K.-J. Lange. Unambiguity of circuits. In Proc. of 5th Structure in Complexity Conf., pages 130–137, 1990.
G. Lev, N. Pippenger, and L. G. Valiant. A fast parallel algorithm for routing in permutation networks. IEEE Trans. on Computers, C-30:93–100, 1981.
G. L. Miller and J. Reif. Parallel tree contraction and its applications. In Proc. of 26th FOCS, pages 478–489, 1985.
W. L. Ruzzo. Tree-size bounded alternation. J. Comput. Syst. Sci., 21:218–235, 1980.
W. L. Ruzzo. On uniform circuit complexity. J. Comput. Syst. Sci., 22:365–383, 1981.
M. Snir. On parallel searching. In Proc. SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 242–253, Ottawa, Canada, 1982.
L. Stockmeyer and U. Vishkin. Simulation of parallel random access machines by circuits. SIAM J. Comput., 13(2):409–422, May 1984.
I. H. Sudborough. On the tape complexity of deterministic context-free languages. J. ACM, 25:405–414, 1978.
H. Venkateswaran. Properties that characterize LOGCFL. In Proc. of 19th STOC, pages 141–150, 1987.
J. C. Wyllie. The Complexity of Parallel Computations. Ph.d. dissertation, Cornell University, Computer Science Department, Ithaca, NY, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rossmanith, P. (1991). The owner concept for PRAMs. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020797
Download citation
DOI: https://doi.org/10.1007/BFb0020797
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53709-0
Online ISBN: 978-3-540-47002-1
eBook Packages: Springer Book Archive