@inproceedings{93159d9d4d1b4ee282cc45db303af860,
title = "Sharing memory robustly in message-passing systems",
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.",
author = "Hagit Attiya and Amotz Bar-Noy and Danny Dolev",
year = "1990",
month = aug,
day = "1",
doi = "10.1145/93385.93441",
language = "אנגלית",
isbn = "9780897914048",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "Publ by ACM",
pages = "363--375",
booktitle = "PODC 1990",
note = "9th Annual ACM Symposium on Principles of Distributed Computing, PODC 1990 ; Conference date: 22-08-1990 Through 24-08-1990",
}