A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
How to share memory in a distributed system
Journal of the ACM (JACM)
New lower bounds for parallel computation
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
One, two, three . . . infinity: lower bounds for parallel computation
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
New lower bounds for parallel computation
Journal of the ACM (JACM)
Parallel arithmetic with concurrent writes
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An Optimal Implementation of Broadcasting with Selective Reduction
IEEE Transactions on Parallel and Distributed Systems
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On parallel searching (Extended Abstract)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The inherent cost of nonblocking commitment
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Relations between concurrent-write models of parallel computation
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Optimal parallel algorithms for string matching
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Unbounded fan-in circuits and associative functions
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Broadcast Communications and Distributed Algorithms
IEEE Transactions on Computers
An improved lower bound on the sensitivity complexity of graph properties
Theoretical Computer Science
An O(log N) parallel time exact hidden-line algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
On the sensitivity complexity of bipartite graph properties
Theoretical Computer Science
Sensitivity of Boolean formulas
European Journal of Combinatorics
Gems in decision tree complexity revisited
ACM SIGACT News
| Hi-index | 0.01 |
We prove that a parallel RAM with no write conflicts allowed requires -&-Ohgr;(log n) steps to compute the Boolean or of n bits stored in the first n global memory cells. We first argue that this result is subtler than it appears, and in fact the -&-ldquo;obvious-&-rdquo; lower bound of log2n steps can be beaten.