Simulating shared memory in message passing model

The authors present an algorithm to simulate shared memory primitives in a message passing system with synchronous processors and synchronous communication. This implies that it is possible to construct emulators that translate algorithms for the shared memory model to that of the message passing model. Also, the results imply that the existence of the solution for a problem in one model guarantees the existence of a solution in the other model. However, in most cases it is not possible to maintain the same degree of resilience since the shared memory model is more powerful than the message passing model in this respect. The authors describe the message passing model and discuss how its parameters affect the design of the algorithms. The algorithm uses bounded local storage and message size.<<ETX>>

[1]  Gary L. Peterson,et al.  Constructing multi-reader atomic values from non-atomic values , 1987, PODC '87.

[2]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

[3]  Gary L. Peterson,et al.  Concurrent Reading While Writing , 1983, TOPL.

[4]  Larry Rudolph,et al.  Efficient synchronization of multiprocessors with shared memory , 1986, PODC '86.

[5]  Maurice Herlihy,et al.  Impossibility and universality results for wait-free synchronization , 1988, PODC '88.

[6]  Danny Dolev,et al.  Shared-memory vs. message-passing in an asynchronous distributed environment , 1989, PODC '89.

[7]  Ambuj K. Singh,et al.  The elusive atomic register revisited , 1987, PODC '87.

[8]  Benny Chor,et al.  Solvability in asynchronous environments , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Hagit Attiya,et al.  Sharing memory robustly in message-passing systems , 1990, PODC '90.

[10]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Richard Newman-Wolfe,et al.  A protocol for wait-free, atomic, multi-reader shared variables , 1987, PODC '87.

[12]  Larry Rudolph,et al.  Efficient synchronization of multiprocessors with shared memory , 1988, TOPL.

[13]  Bard Bloom,et al.  Constructing two-writer atomic registers , 1987, PODC '87.

[14]  Serge A. Plotkin.  Sticky bits and universality of consensus , 1989, PODC '89.