Abstract
The universality of the Parallel Random-Access Machines is usually defined by simulating universal Turing machines or boolean networks. These definitions are well-suited if we are interested in evaluating the complexity of algorithms but it is not as good if we want to deal with computability. We propose in this paper another definition for the universality of the Parallel Random-Access Machines based on cellular automata and we discuss the advantages and the drawbacks of this simulation. We prove that there exists a Concurrent-Read Exclusive-Write Parallel Random-Access Machine which is capable of simulating any given cellular automaton in constant time. We then derive to the definition of complexity classes for the Parallel Random-Access Machines and for cellular automata.
This work was supported by Esprit Basic Research Action “Algebraic and Syntactic Methods In Computer Science” and by the Programme de Recherches Coordonnées Mathématiques- Informatique
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Albert and K. Culik II. A simple universal cellular automaton and its one-way and totalistic version. Complex Systems, 1:1–16, 1987.
J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity II. Springer Verlag, 1990.
Y. Feldman and E. Shapiro. Spatial machines, a more realistic approach to parallel computation. Communications of the ACM, 35(10):61–73, 1992.
T. Hagerhup. Fast and optimal simulations between CRCW PRAMs. In STACS '92, Lecture Notes in Computer Science, pages 45–56. Springer Verlag, 1992.
R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, volume A, chapter 17. Elsevier, 1990.
M. Machtey and P. Young. An introduction to the general theory of algorithms. Theory of computation series, North Holland, 1978.
J. Mahajan and K. Krithivasan. Relativised cellular automata and complexity classes. In S. Biswas and K. V. Nori, editors, FSTCS, Lecture Notes in Computer Science. Springer Verlag, 1991.
B. Martin. Efficient unidimensional universal cellular automaton. In Proceedings of the Mathematical Foundations of Computer Science. Springer Verlag, August 1992.
B. Martin. Construction modulaire d'automates cellulaires. PhD thesis, Ecole Normale Supérieure de Lyon, 1993.
B. Martin. A universal cellular automaton in quasi-linear time and its s-m-n form. Theoretical Computer Science, 123, 1994. To be published.
H. Rogers. Theory of recursive functions and effective computability. Mc Graw-Hill, 1967.
R. Sommerhadler and S.C. van Westrhenen. The Theory of Computability, Programs, Machines, Effectiveness and Feasibility. Addison Wesley, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, B. (1993). A uniform universal CREW PRAM. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_47
Download citation
DOI: https://doi.org/10.1007/3-540-57182-5_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57182-7
Online ISBN: 978-3-540-47927-7
eBook Packages: Springer Book Archive