Practical constructive schemes for deterministic shared-memory access

We present three explicit schemes for distributingM variables amongN memory modules, whereM=Θ(N1.5),M = Θ(N2), andM=Θ(N3), respectively. Each variable is replicated into a constant number of copies stored in distinct modules. We show thatN processors, directly accessing the memories through a complete interconnection, can read/write any set ofN variables in worst-case timeO (N1/3),O(N1/2), andO(N2/3), respectively for the three schemes. The access times for the last two schemes are optimal with respect to the particular redundancy values used by such schemes. The address computation can be carried out efficiently by each processor without recourse to a complete memory map and requiring onlyO(1) internal storage.

[1]  Kieran T. Herley,et al.  Space-efficient representations of shared data for parallel computers , 1990, SPAA '90.

[2]  Friedhelm Meyer auf der Heide,et al.  Simple, efficient shared memory simulations , 1993, SPAA '93.

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

[4]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[5]  D. R. Hughes.  Design Theory , 1985 .

[6]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[7]  Erwin Schrödinger International,et al.  Supported by the Austrian Federal Ministry of Education, Science and Culture , 1689 .

[8]  Gianfranco Bilardi,et al.  Deterministic Simulations of PRAMs on Bounded Degree Networks , 1994, SIAM J. Comput..

[9]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1986, MFCS.

[10]  Andrea Pietracaprina,et al.  On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem , 1993, STACS.

[11]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[12]  Yonatan Aumann,et al.  Improved Memory Utilization in Deterministic PRAM Simulation , 1991, J. Parallel Distributed Comput..

[13]  David J. Kuck,et al.  A Survey of Parallel Machine Organization and Programming , 1977, CSUR.

[14]  Moshe Morgenstern,et al.  Natural bounded concentrators , 1995, Comb..

[15]  Kurt Mehlhorn,et al.  Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories , 1984, Acta Informatica.

[16]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[17]  Fabrizio Luccio,et al.  A new scheme for the deterministic simulation of PRAMs in VLSI , 2005, Algorithmica.

[18]  Geppino Pucci,et al.  Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy , 1994, ESA.

[19]  Kieran T. Herley,et al.  Efficient simulations of small shared memories on bounded degree networks , 1989, 30th Annual Symposium on Foundations of Computer Science.