Efficient optimistic concurrency control using loosely synchronized clocks

Adya, Atul; Gruber, R.; Liskov, Barbara; Maheshwari, Umesh

doi:10.1145/223784.223787

Cited by 111 publications

(91 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many have exploited the fact that messaging overhead and round-trip counts can be reduced with loosely synchronized clocks (e.g, Adya et. al [2,3]). …”

Section: Other Members Of Protocol Familymentioning

confidence: 99%

Efficient Consistency for Erasure-Coded Data via Versioning Servers

Goodson

Wylie²,

Ganger³

et al. 2003

View full text Add to dashboard Cite

show abstract

“…Many have exploited the fact that messaging overhead and round-trip counts can be reduced with loosely synchronized clocks (e.g, Adya et. al [2,3]). …”

Section: Other Members Of Protocol Familymentioning

confidence: 99%

Efficient Consistency for Erasure-Coded Data via Versioning Servers

Goodson

Wylie²,

Ganger³

et al. 2003

View full text Add to dashboard Cite

show abstract

“…Timestamp-based approaches [16] utilize the generation of an agreed timestamp ordering between the replicas. Finally, optimistic approaches [26], [27] require global validation before a transaction is committed, or a global ordering on committing transactions.…”

Section: Invalidation-based Strong Consistency Scalabilitymentioning

confidence: 99%

Consistent Replication in Distributed Multi-Tier Architectures

Repantis¹,

Iyengar²,

Kalogeraki³

et al. 2011

Proceedings of the 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing

View full text Add to dashboard Cite

Abstract-Replication is commonly used to address the scalability and availability requirements of collaborative web applications in domains such as computer supported cooperative work, social networking, e-commerce and e-banking. While providing substantial benefits, replication also introduces the overhead of maintaining data consistent among the replicated servers. In this work we study the performance of common replication approaches with various consistency guarantees and argue for the feasibility of strong consistency. We propose an efficient, distributed, strong consistency protocol and reveal experimentally that its overhead is not prohibitive. We have implemented a replication middleware that offers different consistency protocols, including our strong consistency protocol. We use the TPC-W transactional web commerce benchmark to provide a comprehensive performance comparison of the different replication approaches under a variety of workload mixes.

show abstract

“…For example, in replicated stock quotes systems, stale values are allowed to be read even if 1SR is maintained, as such stale reads can be considered to execute "in the past" by 1SR. As in timed consistency [Singla et al 1997;Torres-Rojas et al 1999] and external consistency [Adya et al 1995], we augment 1SR with external order, which is a partial order over all accesses. An access A 1 externally precedes another access A 2 if A 1 returns its observed result to the user (in strict wall-clock time) before A 2 is submitted to its originating replica.…”

Section: System Modelmentioning

confidence: 99%

Design and evaluation of a conit-based continuous consistency model for replicated services

Vahdat

2002

ACM Trans. Comput. Syst.

245

211

View full text Add to dashboard Cite

The tradeoffs between consistency, performance, and availability are well understood. Traditionally, however, designers of replicated systems have been forced to choose from either strong consistency guarantees or none at all. This paper explores the semantic space between traditional strong and optimistic consistency models for replicated services. We argue that an important class of applications can tolerate relaxed consistency, but benefit from bounding the maximum rate of inconsistent access in an application-specific manner. Thus, we develop a conit-based continuous consistency model to capture the consistency spectrum using three application-independent metrics, numerical error, order error, and staleness. We then present the design and implementation of TACT, a middleware layer that enforces arbitrary consistency bounds among replicas using these metrics. We argue that the TACT consistency model can simultaneously achieve the often conflicting goals of generality and practicality by describing how a broad range of applications can express their consistency semantics using TACT and by demonstrating that application-independent algorithms can efficiently enforce target consistency levels. Finally, we show that three replicated applications running across the Internet demonstrate significant semantic and performance benefits from using our framework.

show abstract

Efficient optimistic concurrency control using loosely synchronized clocks

Cited by 111 publications

References 15 publications

Efficient Consistency for Erasure-Coded Data via Versioning Servers

Efficient Consistency for Erasure-Coded Data via Versioning Servers

Consistent Replication in Distributed Multi-Tier Architectures

Design and evaluation of a conit-based continuous consistency model for replicated services

Contact Info

Product

Resources

About