Sharing memory robustly in message-passing systems

Hagit Attiya*, Amotz Bar-Noy, Danny Dolev

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

25 Scopus citations

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 algorithn based on atomic, single-writer multi-reader registers can be automatically emulated in message-passing systems. The over-head 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.

Original languageEnglish
Pages363-375
Number of pages13
DOIs
StatePublished - 1990
Externally publishedYes
EventProceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing - Quebec City, Que, Can
Duration: 22 Aug 199024 Aug 1990

Conference

ConferenceProceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing
CityQuebec City, Que, Can
Period22/08/9024/08/90

Fingerprint

Dive into the research topics of 'Sharing memory robustly in message-passing systems'. Together they form a unique fingerprint.

Cite this