MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Lazy Consistency Using Loosely Synchronized Clocks (1997) [17 citations — 3 self]

by Atul Adya ,  Barbara Liskov
In Proceedings of the ACM Symposium on Principles of Distributed Computing
Add To MetaCart

Abstract:

This paper describes a newscheme for guaranteeing that transactions in a client/server system observe consistent state while they are running. The scheme is presented in conjunction with an optimistic concurrency control algorithm, but could also be used to prevent read-only transactions from conflicting with read/write transactions in a multi-version system. The scheme is lazy about the consistency it provides for running transactions and also in the way it generates the consistency information. The paper presents results of simulation experiments showing that the cost of the scheme is negligible. The scheme uses multipart timestamps to inform nodes about information they need to know. Today the utility of such schemes is limited because timestamp size is proportional to system size and therefore the schemes don't scale to very large systems. We show how to solve this problem. Our multipart timestamps are based on real rather than logical clocks; we assume clocks in the system are loo...

Citations

1804 Time, Clocks, and the Ordering of Events in Distributed Systems – Lamport - 1978
1320 Concurrency Control and Recovery in Database Systems – Bernstein, Hadzilacos, et al. - 1987
1143 Transaction Processing: Concepts and Techniques – Gray, Reuter - 1993
530 Lightweight Causal and Atomic Group Multicast – Birman, Schiper, et al. - 1991
503 U-Net: a user-level network interface for parallel and distributed computing – Eicken, Basu, et al. - 1995
401 Lazy release consistency for software distributed shared memory – Keleher, Cox, et al. - 1992
312 Network Time Protocol (Version 3) Specification, Implementation. rfc 1305 – Mills - 1992
256 Notes on Database Operating Systems – Gray - 1978
120 Session guarantees for weakly consistent replicated data – Terry, Demers, et al. - 1994
114 Providing high availability using lazy replication – Ladin, Liskov, et al. - 1992
84 Efficient optimistic concurrency control using loosely synchronized clocks – Adya, Gruber, et al. - 1995
84 Multi-Level Caching in Distributed File Systems - or - Your Cache Ain’t Nuthin’ But Trash – Muntz, Honeyman - 1992
76 Fine-grained sharing in a page server OODBMS – Carey, Franklin, et al. - 1994
48 Caching in Large-scale Distributed File Systems – Blaze - 1993
43 Practical Uses of Synchronized Clocks in Distributed Systems – Liskov - 1993
41 An Empirical Study of a Wide-Area Distributed File System – Spasojevic, Satyanarayanan - 1996
36 Distributed Version Management for Read-only Actions – Weihl - 1987
28 Observations on Optimistic Concurrency Control Schemes – Haerder - 1984
26 The Modified Object Buffer: A Storage Management Technique for ObjectOriented Databases – Ghemawat - 1995
24 Implementing Distributed Read-Only Transactions – Chan, Gray - 1985
24 Optimism vs. Locking: A Study of Concurrency Control for Client-Server ObjectOriented Databases – Gruber - 1996
17 Two-Phase Commit Optimizations in a Commercial Distributed Environment – Samaras, Britton, et al. - 1995
15 et al. Detection of Mutual Inconsistency in Distributed Systems – Parker - 1983
14 The Network Computer as Precision Timekeeper – Mills - 1996
11 Distributed Multi-version Optimistic Concurrency Control with Reduced Rollback – Agrawal, Bernstein, et al. - 1987
5 et al. Safe and efficient sharing of persistent objects – Liskov - 1996
3 Orphan Detection. Programming Methodology Group Memo 53 – Liskov, Scheifler, et al. - 1987
2 Read-Only Transactions in a Distributed Database – Garcia, Weiderhold - 1982
View or Download | Add to My Collection | Correct Errors