Sharing memory robustly in message-passing systems
Open Access
- 3 January 1995
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 42 (1) , 124-142
Abstract
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, single-writer multi-reader register in unreliable, asynchronous networks. The two message-passing models considered are a complete network with processor failures and an arbitrary network with dynamic link failures.These results make it possible to view the shared-memory model as a higher-level language for designing algorithms in asynchronous distributed systems. Any wait-free algorithm based on atomic, single-writer multi-reader registers can be automatically emulated in message-passing systems, provided that at least a majority of the processors are not faulty and remain connected. The overhead introduced by these emulations is polynomial in the number of processors in the system.Immediate new results are obtained by applying the emulators to known shared-memory algorithms. These include, among others, protocols to solve the following problems in the message-passing model in the presence of processor or link failures: multi-writer multi-reader registers, concurrent time-stamp systems,l-exclusion, atomic snapshots, randomized consensus, and implementation of data structures.Keywords
This publication has 7 references indexed in Scilit:
- Atomic snapshots of shared memoryJournal of the ACM, 1993
- Bounded time-stampsDistributed Computing, 1993
- Composite registersDistributed Computing, 1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Renaming in an asynchronous environmentJournal of the ACM, 1990
- On achieving consensus using a shared memory1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985