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