DMCA
Sharing Memory Robustly in Message-Passing Systems (1990)
Cached
Download Links
- [groups.csail.mit.edu]
- [www.cs.huji.ac.il]
- DBLP
Other Repositories/Bibliography
| Citations: | 144 - 8 self |
BibTeX
@MISC{Attiya90sharingmemory,
author = {Hagit Attiya and Amotz Bar-Noy and Danny Dolev},
title = {Sharing Memory Robustly in Message-Passing Systems },
year = {1990}
}
Share
 |
 |
 |
 |
||
OpenURL
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. The overhead introduced by these emulations is polynomial in the number of processors in the systems. 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, £-exclusion, atomic snapshots, randomized consensus, and implementation of a class of data structures.
Keyphrases
memory robustly message-passing model shared-memory model following problem link failure asynchronous distributed system single-writer multi-reader register dynamic link failure different messagepassing model multi-writer multi-reader register higher-level lan guage arbitrary network singlewriter multi-reader register consen sus data structure atomic snapshot complete network processor failure shared-memory algorithm immediate new result concurrent time-stamp system wait-free algorithm asynchronous network
