Cache coherence protocols: evaluation using a multiprocessor simulation model
ACM Transactions on Computer Systems (TOCS)
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Parallel RAMs with owned global memory and deterministic contex-free language recognition
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Parallel time O (log n) recognition of unambiguous context-free languages
Information and Computation
Parallel time O(log n) acceptance of deterministic CFLs on an exclusive-write P-RAM
SIAM Journal on Computing
The power of parallel pointer manipulation
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The complexity of short two-person games
Discrete Applied Mathematics
Toward understanding exclusive read
SIAM Journal on Computing
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
SIAM Journal on Computing
Fast recognition of deterministic cfl's with a smaller number of processors
Theoretical Computer Science
Theoretical Computer Science
Computational Complexity
Pointers versus arithmetic in PRAMs
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Data-Independences of Parallel Random Access Machines
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
PRAM's Towards Realistic Parallelism: BRAM's
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Parallel Merge Sort on Concurrent-Read Owner-Write PRAM
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of parallel computations
The complexity of parallel computations
Fast parallel recognition of LR language suffixes
Information Processing Letters
Fast parallel recognition of LR language suffixes
Information Processing Letters
| Hi-index | 0.01 |
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Write, or CROW-PRAMS, 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. Considering the difficulties that would be involved in physically realizinga full CREW-PRAM model and demonstrate its stability under several definitional changes. Second, we precisely characterize the power of the CROW-PRAM by showing that the class of languages recognizable by it in time O(log n) (and implicity with a polynomial number of processors) is exactly the class LOGDCFL of languages log space reducible to deterministic context-free languages. Third, using the same basic machinery, we show that the recognition problem for deterministic context-free languages can be solved quickly on a deterministic auxilliary pushdown automation having random access to its input tape, a log n space work tape, and pushdown store of small maximum height. For example, time O(n1 + &egr;) is achievable with pushdown height O(log2 n). These result extend and unify work of von Braunmöhl, Cook, Mehlhorn, and Verbeek, Klein and Reif; and Rytter.