Space-efficient representations of shared data for parallel computers

The problem of representing a set. tr k (2~1,. . . . II,,} of read-write variables on an n-node distribut,ed memory pa.rallel computer is considered. It is shown that, Cr can be represented among the n nodes of a variant. of tlie mesh-of-t,rees using O((?n/77)polyIoy( )??/)I)) storage per node such tha.t any n-tuple of variables ma.y be accessed in O(log n(10glogn)~) time in t,he worst ca.se for m polynomial in n.

[1]  Eli Upfal,et al.  How to share memory in a distributed system , 1984, JACM.

[2]  L. Valiant.  Optimally universal parallel computers , 1988, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[3]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1987, SIAM J. Comput..

[4]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1986, SIAM J. Comput..

[5]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[6]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[7]  Kieran T. Herley.  Improved Bounds for the Token Distribution Problem , 1989 .

[8]  Eli Upfal,et al.  The token distribution problem , 1989, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[9]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[10]  Abhiram G. Ranade,et al.  How to emulate shared memory (Preliminary Version) , 1987, FOCS.

[11]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[12]  Friedhelm Meyer auf der Heide,et al.  Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  A Probabilistic Simulation of PRAMs on a Bounded Degree Network , 1988, Inf. Process. Lett..

[14]  Eli Upfal,et al.  A probabilistic relation between desirable and feasible, models of parallel computation , 1984, STOC '84.

[15]  Franco P. Preparata,et al.  Deterministic P-RAM simulation with constant redundancy , 1989, SPAA '89.

[16]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[17]  K. Herley.  Deterministic simulation of shared memory on bounded degree networks , 1990 .