Work

Sharing memory robustly in message-passing systems

Year: 1990
Type: conference-paper
Abstract: Emulators that translate algorithms from the sharedmemory 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 sharedmemory 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.
Language: English
Open Access status: bronze
OpenAlex ID: W1968335271
FWCI: 3.432
Cites: 37
Cited by: 61
Related to: 9