NDLI: Concurrency and availability as dual properties of replicated atomic data

Content Provider	ACM Digital Library
Author	Herlihy, M.
Copyright Year	1990
Abstract	A replicated data object is a typed object that is stored redundantly at multiple locations in a distributed system. Each of the object's operations has a set of quorums, which are sets of sites whose cooperation is needed to execute that operation. A quorum assignment associates each operation with its set of quorums. An operation's quorums determine its availability, and the constraints governing an object's quorum assignments determine the range of availability properties realizable by replication.In this paper, the restrictions on quorum assignment imposed by three kinds of atomicity mechanisms found in the literature are analyzed: (1) serial schemes, in which replication and atomicity are implemented independently at different levels in the system, (2) static schemes, in which the transaction serialization order is predetermined, and (3) hybrid schemes in which the serialization order emerges dynamically.The following results are derived: (1) Although serial schemes place the strongest restrictions on concurrency, they place the weakest restrictions on availability. (2) Although hybrid and static mechanisms place incomparable restrictions on concurrency, hybrid mechanisms place weaker restrictions on availability. (3) Bounding the maximum depth of transaction nesting strengthens restrictions on concurrency for all classes, but weakens restrictions on availability for hybrid schemes only. Concurrency and availability are best considered as dual properties: A complete analysis of an atomicity mechanism should take both into account.
Starting Page	257
Ending Page	278
Page Count	22
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/77600.77616
Journal	Journal of the ACM (JACM)
Volume Number	37
Issue Number	2
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1990-04-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
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

A theorem in database concurrency control

Cost and availability tradeoffs in replicated data concurrency control

On the analytical modeling of database concurrency control

Algebraic laws for nondeterminism and concurrency

A weighted voting algorithm for replicated directories

Locking Expressions for Increased Database Concurrency

Proving Properties of Complex Data Structures

A model for concurrency in nested transactions systems

Properties of Linear Machines

Concurrency and availability as dual properties of replicated atomic data

Similar Documents

A theorem in database concurrency control

Cost and availability tradeoffs in replicated data concurrency control

On the analytical modeling of database concurrency control

Algebraic laws for nondeterminism and concurrency

A weighted voting algorithm for replicated directories

Locking Expressions for Increased Database Concurrency

Proving Properties of Complex Data Structures

A model for concurrency in nested transactions systems

Properties of Linear Machines

Concurrency and availability as dual properties of replicated atomic data