NDLI: Sharing memory robustly in message-passing systems

Content Provider	ACM Digital Library
Author	Attiya, Hagit Bar-Noy, Amotz Dolev, Danny
Copyright Year	1995
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, $\textit{l}-exclusion,$ atomic snapshots, randomized consensus, and implementation of data structures.
Starting Page	124
Ending Page	142
Page Count	19
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/200836.200869
Journal	Journal of the ACM (JACM)
Volume Number	42
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1995-01-03
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Atomic registers Emulation Fault-tolerance Message passing Processor and link failures Shared memory Wait-freedom
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Conditions on input vectors for consensus solvability in asynchronous distributed systems

Fault-tolerant wait-free shared objects

Graceful quorum reconfiguration in a robust emulation of shared memory

Brief Announcement: Robust and Private Distributed Shared Atomic Memory in Message Passing Networks

Unreliable failure detectors for reliable distributed systems

The weakest failure detector for solving consensus

Atomic snapshots of shared memory

Robust wait-free hierarchies

Consensus with Unknown Participants in Shared Memory

Sharing memory robustly in message-passing systems

Similar Documents

Conditions on input vectors for consensus solvability in asynchronous distributed systems

Fault-tolerant wait-free shared objects

Graceful quorum reconfiguration in a robust emulation of shared memory

Brief Announcement: Robust and Private Distributed Shared Atomic Memory in Message Passing Networks

Unreliable failure detectors for reliable distributed systems

The weakest failure detector for solving consensus

Atomic snapshots of shared memory

Robust wait-free hierarchies

Consensus with Unknown Participants in Shared Memory

Sharing memory robustly in message-passing systems