Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
One, two, three . . . infinity: lower bounds for parallel computation
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The parallel simplicity of compaction and chaining
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Improved upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
SIAM Journal on Computing
Towards a theory of nearly constant time parallel algorithms
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Time complexity of Boolean functions on CREW PRAMs
SIAM Journal on Computing
On the degree of Boolean functions as real polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An Ω(√ log log n) lower bound for routing in optical networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Parallel Retrieval of Scattered Information
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
ERCW PRAMs and Optical Communication
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Fast Integer Merging on the EREW PRAM
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A lower bound for the QRQW PRAM
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Sensitive functions and approximate problems
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we study the question: How useful is randomization in speeding up Exclusive Write PRAM computations? Our results give further evidence that randomization is of limited use in these types of computations. First we examine a compaction problem on both the CREW and EREW PRAM models, and we present randomized lower bounds which match the best deterministic lower bounds known. (For the CREW PRAM model, the lower bound is asymptotically optimal.) These are the first nontrivial randomized lower bounds known for the compaction problem on these models. We show that our lower bounds also apply to the problem of approximate compaction. Next we examine the problem of computing boolean functions on the CREW PRAM model, and we present a randomized lower bound which improves on the previous best randomized lower bound for many boolean functions, including the OR function. (The previous lower bounds for these functions were asymptotically optimal, but we improve the constant multiplicative factor.) We also give an alternate proof for the randomized lower bound on PARITY, which was already optimal to within a constant additive factor. Lastly, we give a randomized lower bound for integer merging on an EREW PRAM which matches the best deterministic lower bound known. In all our proofs, we use the Random Adversary method, which has previously only been used for proving lower bounds on models with Concurrent Write capabilities. Thus this paper also serves to illustrate the power and generality of this method for proving parallel randomized lower bounds.