NDLI: On the correctness of orphan management algorithms

Content Provider	ACM Digital Library
Author	Herlihy, Maurice Lynch, Nancy Merritt, Michael Weihl, William
Copyright Year	1992
Abstract	In a distributed system, node failures, network delays, and other unpredictable occurences can result in $\textit{orphan}$ computations—subcomputations that continue to run but whose results are no longer needed. Several algorithms have been proposed to prevent such computations from seeing inconsistent states of the shared data. In this paper, two such orphan management algorithms are analyzed. The first is an algorithm implemented in the Argus distributed-computing system at MIT, and the second is an algorithm proposed at Carnegie-Mellon. The algorithms are described formally, and complete proofs of their correctness are given.The proofs show that the fundamental concepts underlying the two algorithms are very similar in that each can be regarded as an implementation of the same high-level algorithm. By exploiting properties of information flow within transaction management systems, the algorithms ensure that orphans only see states of the shared data that they could also see if they were not orphans. When the algorithms are used in combination with any correct concurrency control algorithm, they guarantee that all computations, orphan as well as nonorphan, see consistent states of the shared data.
Starting Page	881
Ending Page	930
Page Count	50
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/146585.146616
Journal	Journal of the ACM (JACM)
Volume Number	39
Issue Number	4
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1992-10-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Argus Atomic actions Avalon Camelot Input-output automata Recovery Serializability
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

Useless Actions Make a Difference: Strict Serializability of Database Updates

Input-Error-Limiting Automata

Serializability by Locking

Input-Output Buffering and Fortran

The serializability of concurrent database updates

The Share 709 System: Input-Output Translation

The Share 709 System: Programmed Input-Output Buffering

Realization of Input-Output Relations by Sequential Machines

Group-Type Automata

On the correctness of orphan management algorithms

Similar Documents

Useless Actions Make a Difference: Strict Serializability of Database Updates

Input-Error-Limiting Automata

Serializability by Locking

Input-Output Buffering and Fortran

The serializability of concurrent database updates

The Share 709 System: Input-Output Translation

The Share 709 System: Programmed Input-Output Buffering

Realization of Input-Output Relations by Sequential Machines

Group-Type Automata

On the correctness of orphan management algorithms