Concurrency versus Availability: Atomicity Mechanisms for Replicated Data

24Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

A replicated object is a typed data object that is stored redundantly at multiple locations to enhance availability. Most techniques for managing replicated data have a two-level structure: At the higher level, a replica-control protocol reconstructs the object's state from its distributed components, and at the lower level, a standard concurrency-control protocol synchronizes accesses to the individual components. This paper explores an alternative approach to managing replicated data by presenting two replication methods in which concurrency control and replica management are handled by a single integrated protocol. These integrated protocols permit more concurrency than independent protocols, and they allow availability and concurrency to be traded off: Constraints on concurrency may be relaxed if constraints on availability are tightened, and vice versa. In general, constraints on concurrency and availability cannot be minimized simultaneously. © 1987, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Herlihy, M. (1987). Concurrency versus Availability: Atomicity Mechanisms for Replicated Data. ACM Transactions on Computer Systems (TOCS), 5(3), 249–274. https://doi.org/10.1145/24068.27643

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free