Fredman-Kolmo´s bounds and information theory
SIAM Journal on Algebraic and Discrete Methods
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Optimal bounds for decision problems on the CRCW PRAM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The parallel complexity of element distinctness is Ω(√log n)
SIAM Journal on Discrete Mathematics
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Tight bounds for the chaining problem
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Partially effective randomization in simulations between arbitrary and common PRAMs
Journal of Parallel and Distributed Computing
Communication lower bounds via the chromatic number
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
| Hi-index | 0.00 |
We obtain tight bounds on the relative powers of the Priority and Common models of parallel random-access machines (PRAMs). Specifically we prove that:The Element Distinctness function of n integers, though solvable in constant time on a Priority PRAM with n processors, requires &OHgr;(A(n,p)) time to solve on a Common PRAM with p ≥ n processors, where A(n,p) = n log n/p log (n/p log n + 1).One step of a Priority PRAM with n processors can be simulated on a Common PRAM with p processors in &Ogr;(A(n,p)) steps.As an example, the results show that the time separation between Priority and Common PRAMs each with n processors is &THgr;(log n/log log n).