Limits on the power of concurrent-write parallel machines

The computation of specific functions using the most general form of concurrentread-concurrent-write parallel RAM is considered. It is shown that such a machine can compute any function of Boolean inputs in time log n log log n + 0( 1) given a polynomial number of processors and memory cells and that this bound is tight for integer addition. Despite this evidence of the power of the model we show that a very simple function, namely parity, requires time Q (Jiogn) to compute given a polynomial bound on the number of processors, independent of the number of memory cells. 13” 1988 Academic Press, Inc

[1]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  Ian Parberry.  On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes , 1986, Aegean Workshop on Computing.

[3]  Ludek Kucera,et al.  Parallel Computation and Conflicts in Memory Access , 1982, Information Processing Letters.

[4]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[5]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[6]  Friedhelm Meyer auf der Heide,et al.  On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication , 1984, FOCS.

[7]  Uzi Vishkin,et al.  Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..

[8]  Friedhelm Meyer auf der Heide,et al.  The complexity of parallel sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Friedhelm Meyer auf der Heide,et al.  The Complexity of Parallel Sorting , 1987, SIAM J. Comput..

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

[11]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[12]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[13]  Friedhelm Meyer auf der Heide,et al.  One, two, three . . . infinity: lower bounds for parallel computation , 1985, STOC '85.

[14]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[15]  Uzi Vishkin,et al.  Trade-offs between depth and width in parallel computation , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[16]  Ian Parberry.  On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes , 1987, Theor. Comput. Sci..

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

[18]  John E. Savage,et al.  The Complexity of Computing , 1976 .