Optimal separation of EROW and CROW PRAMs

We consider the problem of evaluating a Boolean function on PRAMs. We exhibit a Boolean function f:{0,1}/sup n//spl rarr/{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 /spl 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 (1997). Our lower bound improves a special case of the previous result of Nisan and Bar-Yossef, who proved a lower bound of /spl Omega/(/spl radic/(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 (E. Gafni et al., 1989; F. Fich et al., 1990; N. Nisan et al., 1997).

[1]  Noam Nisan,et al.  Pointer jumping requires concurrent read , 1997, STOC '97.

[2]  Marc Snir,et al.  On Parallel Searching , 2011, SIAM J. Comput..

[3]  Noam Nisan.  CREW PRAMs and Decision Trees , 1991, SIAM J. Comput..

[4]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[5]  Faith Ellen,et al.  Toward Understanding Exclusive Read , 1990, SIAM J. Comput..

[6]  Walter L. Ruzzo,et al.  Parallel RAMs with owned global memory and deterministic context-free language recognition , 2000, JACM.

[7]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[8]  Joseph Naor,et al.  On Separating the Erew and Crew Pram Models , 1989, Theor. Comput. Sci..

[9]  S. Cook,et al.  Lower bounds in parallel machine computation , 1987 .

[10]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[11]  Faith Ellen,et al.  The Complexity of Computation on the Parallel Random Access Machine , 1993 .

[12]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[13]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[14]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .