Parallel RAMs with owned global memory and deterministic context-free language recognition

  • P. W. Dymond
  • W. L. Ruzzo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)


We identify and study a frequently occurring subclass of Concurrent-Read, Exclusive-Write Parallel Random Access Machines (CREW-PRAM's). Called Concurrent-Read, Owner -Write, or CROW-PRAM's, these are machines in which each global memory location is assigned a unique “owner” processor, which is the only processor allowed to write into it. Most known CREW-PRAM algorithms are in fact CROW-PRAM algorithms. We show that the class of languages recognizable in time O(logn) on CROW-PRAM's is precisely equal to the class LOGDCFL of languages log space reducible to deterministic context free languages, and demonstrate the stability of the CROW-PRAM model. Our characterization theorem is based on a new and simpler proof of a result due to Klein and Reif that the recognition problem for any deterministic context free language can be solved in time O(logn) on a CREW-PRAM. We show that the simulation can actually be carried out on the CROW-PRAM model mentioned above. Next, using the same basic machinery, we give a new and simpler proof of the results by von Braunmühl, Cook, Mehlhorn, and Verbeek that DCFL recognition can be done in O(log2n) space and polynomial time, simultaneously, i.e. in SC2. Further, we obtain a technical improvement to their result in that our algorithm requires only a O(log2n) height pushdown store, rather than general space.


Global Memory Surface Configuration Random Access Machine Parallel Random Access Machine Processor Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BCMV]
    von Braunmühl, Cook, Mehlhorn, and Verbeek, The recognition of deterministic CFL's in small time and space, Information and Control 56, (1983) 34–51.Google Scholar
  2. [C]
    S.A. Cook, Deterministic CFL's are accepted simultaneously in polynomial time and log squared space, 11th ACM STOC(1979) 338–345.Google Scholar
  3. [CDR]
    S.A.Cook, C.Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, preprint, 1983.Google Scholar
  4. [DC]
    P.W. Dymond and S.A. Cook, Hardware complexity and parallel computation, Proc. 21st IEEE Symposium on Foundations of Computer Science, (1980) 360–372.Google Scholar
  5. [DR]
    P.W. Dymond and W.L. Ruzzo, Parallel RAM's with owned global memory and deterministic context-free language recognition, Technical Report, 1986.Google Scholar
  6. [FW]
    S. Fortune and P. Wyllie, Parallelism in random access machines, 10th ACM STOC(1978), 114–118.Google Scholar
  7. [G]
    L.M. Goldschlager, A unified approach to models of synchronous parallel machines, J. ACM 29, (1982) 1073–1086.Google Scholar
  8. [H]
    M. Harrison, Introduction to Formal Language Theory, Addison Wesley, 1979.Google Scholar
  9. [Ha]
    T. Harju, A simulation result for the auxiliary pushdown automata, JCSS 19 (1979), 119–132.Google Scholar
  10. [KR]
    P.N. Klein and J. Reif, Parallel Time O(log n) acceptance of deterministic CFL's, Harvard University Aiken Computation Laboratory, Technical Report TR-05-84.Google Scholar
  11. [R]
    W.L. Ruzzo, Tree-size bounded alternation, JCSS 21 (1980) 218–235.Google Scholar
  12. [R1]
    W.L. Ruzzo, The equivalence of hardware modification machines and restricted parallel random access machines, preprint, 1984.Google Scholar
  13. [S]
    I. Sudborough, On tape complexity of deterministic context-free languages, JACM 25 (1978)405–414Google Scholar
  14. [Sn]
    M. Snir, personal communication.Google Scholar
  15. [SV]
    L.J. Stockmeyer and U. Vishkin, Simulation of random access machines by circuits, SIAM J. on Computing 13, (1984) 409–422.Google Scholar
  16. [V]
    U. Vishkin, Synchronous parallel computation — a survey, TR-71, Dept. of Computer Science, Courant Institute NYU, (1983).Google Scholar
  17. [W]
    J.C. Wyllie, The complexity of parallel computations, TR 79-387, Dept. of Computer Science, Cornell University, (1979).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • P. W. Dymond
    • 1
  • W. L. Ruzzo
    • 2
  1. 1.Dept. of Computer Science, C-014University of CaliforniaSan Diego La Jolla
  2. 2.Dept. of Computer Science, FR-35University of WashingtonSeattle

Personalised recommendations