18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. (2003)

Aarhus, Denmark

July 7, 2003 to July 10, 2003

ISSN: 1093-0159

ISBN: 0-7695-1879-6

pp: 93

ABSTRACT

We consider the problem of evaluating a boolean function on PRAMs. We exhibit a boolean function f : {0, 1}<sup>n</sup> \Omega {0, 1} that can be evaluated in time O(log log n) in a deterministic CROW (Concurrent Read Owner Write) PRAM model, but requires time \Omega (log n) in EROW (Exclusive Read Owner Write) PRAM. Our lower bound also holds in the randomized Monte Carlo EROW model. This boolean function is derived from the well-known pointer chasing problem, and was first considered by Nisan and Bar-Yossef [10]. Our lower bound improves a special case of the previous result of Nisan and Bar-Yossef, who proved a lower bound of \Omega (\sqrt {\log n}) for this function in the deterministic EREW model (and hence in the EROW model). Our result is the first to achieve the best possible separation between the CROW and EROW PRAM models for functions on complete domains (boolean or nonboolean), improving the previous results ([7, 6, 10]).

INDEX TERMS

null

CITATION

S. Venkatesh, M. Saks and N. Goyal, "Optimal Separation of EROW and CROWPRAMs,"

*18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.(CCC)*, Aarhus, Denmark, 2003, pp. 93.

doi:10.1109/CCC.2003.1214413

CITATIONS