A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
Bounds on the time for parallel RAM's to compute simple functions
STOC '82 Proceedings of the fourteenth 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
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
Efficient algorithms for multiple access channels
Efficient algorithms for multiple access channels
Limits on the power of concurrent-write parallel machines
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
New lower bounds for parallel computation
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
New lower bounds for parallel computation
Journal of the ACM (JACM)
Parallel RAMs with bounded memory wordsize
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Exact time bounds for computing boolean functions on PRAMs without simultaneous writes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved parallel algorithms for the depth-first search and monotone circuit value problems
CSC '87 Proceedings of the 15th annual conference on Computer Science
Parallel arithmetic with concurrent writes
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
An O(log N) parallel time exact hidden-line algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
Lower Bounds for Randomized Exclusive Write PRAMs
Theory of Computing Systems
Hi-index | 0.00 |
In this paper we compare the power of the two most commonly used concurrent-write models of parallel computation, the COMMON PRAM and the PRIORITY PRAM. These models differ in the way they resolve write conflicts. If several processors want to write into the same shared memory cell at the same time, in the COMMON model they have to write the same value. In the PRIORITY model, they may attempt to write different values; the processor with smallest index succeeds.We consider PRAM's with n processors, each having arbitrary computational power. We provide the first separation results between these two models in two extreme cases: when the size m of the shared memory is small (m ≤ n&egr;, &egr; In the case of small memory, the PRIORITY model can be faster than the COMMON model by a factor of &THgr;(log n), and this lower bound holds even if the COMMON model is probabilistic. In the case of infinite memory, the gap between the models can be a factor of &OHgr;(log log log n).We develop new proof techniques to obtain these results. The technique used for the second lower bound is strong enough to establish the first tight time bounds for the PRIORITY model, which is the strongest parallel computation model. We show that finding the maximum of n numbers requires &THgr;(log log n) steps, generalizing a result of Valiant for parallel computation trees.