Corpus ID: 27351657

Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions

@inproceedings{Adya1999WeakCA,
  title={Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions},
  author={Atul Adya and Barbara Liskov},
  year={1999}
}
Current commercial databases allow application programmers to trade off consistency for performance. [...] Key Method It also specifies a variety of guarantees for predicate-based operations in an implementation-independent manner. Two new levels are defined that provide useful consistency guarantees to application writers; one is the weakest level that ensures consistent reads, while the other captures some useful consistency properties provided by pessimistic implementations. We use a graph-based approach to…Expand
A Framework for Transactional Consistency Models with Atomic Visibility
TLDR
This work provides a rigorous foundation for developing the metatheory of the novel form of concurrency arising in weakly consistent large-scale databases by specifying a variety of consistency models for transactions uniformly and declaratively. Expand
Algebraic Laws for Weak Consistency (Extended Version)
TLDR
This paper presents a set of novel algebraic laws (i.e. inequations) that connect two styles of specifications, and shows that this algebraic connection gives rise to so called robustness criteria, conditions which ensures that a program running on top of a weakly-consistent database does not exhibit anomalous behaviours due to this weak consistency. Expand
Algebraic Laws for Weak Consistency
TLDR
This paper presents a set of novel algebraic laws that connect two styles of specifications, one based on abstract executions and the other based on dependency graphs, and shows that this algebraic connection gives rise to so called robustness criteria, conditions which ensures that a program running on top of a weakly-consistent database does not exhibit anomalous behaviours due to this weak consistency. Expand
7 : 2 Robustness against Consistency Models with Atomic Visibility
To achieve scalability, modern Internet services often rely on distributed databases with consistency models for transactions weaker than serializability. At present, application programmers oftenExpand
Automatic Analysis of Consistency Properties of Distributed Transaction Systems in Maude
TLDR
This paper presents a general framework for formally specifying a DTS in Maude, and formalizes inMaude nine common consistency properties for DTSs so defined, and provides a fully automated method for analyzing whether the DTS satisfies the desired property for all initial states up to given bounds on system parameters. Expand
Making consistency more consistent: a unified model for coherence, consistency and isolation
TLDR
A new single constraint relationship, result visibility, is defined, which formalizes the "appears to execute before" relationship between operations and forms the broadest survey of ordering guarantees using a single constraint in the current literature. Expand
A new approach to developing and implementing eager database replication protocols
TLDR
A suite of replication protocols that addresses the main problems related to database replication and takes advantage of the rich semantics of group communication primitives and the relaxed isolation guarantees provided by most databases to eliminate the possibility of deadlocks, reduce the message overhead and increase performance. Expand
Checking Robustness Between Weak Transactional Consistency Models
TLDR
This work investigates the problem of checking whether a given program has the same set of behaviors when replacing a consistency model with a weaker one, and shows that checking robustness between these models is polynomial time reducible to a state reachability problem under serializability. Expand
Robustness Against Transactional Causal Consistency
TLDR
This paper investigates application-specific relationships between several variations of causal consistency and addresses the issue of verifying automatically if a given transactional program is robust against causal consistency, i.e., all its behaviors when executed over an arbitrary causally consistent database are serializable. Expand
Checking Robustness Against Snapshot Isolation
TLDR
This paper addresses the issue of verifying if a given program is robust against snapshot isolation, and shows that this verification problem is polynomial time reducible to a state reachability problem in transactional programs over a sequentially consistent shared memory. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 82 REFERENCES
Apologizing versus asking permission: optimistic concurrency control for abstract data types
TLDR
Several new optimistic concurrency control techniques for objects in decentralized distributed systems are described here, their correctness and optimality properties are proved, and the circumstances under which each is likely to be useful are characterized. Expand
Lazy consistency using loosely synchronized clocks
TLDR
A new schemefor guaranteeing that transactions in a client/server system observe consistent state while they are running is described, presented in conjunction with an optimistic concurrency control algorithm. Expand
Safe and efficient sharing of persistent objects in Thor
TLDR
The results show that adaptive prefetching is very effective, improving both the elapsed time of traversals and the amount of space used in the client cache, and the cost of safe sharing can be negligible; thus it is possible to have both safety and high performance. Expand
Consistency and orderability: semantics-based correctness criteria for databases
TLDR
The notions of orderability allow users to operate an isolation as maintenance of the integrity constrainst now becomes the responsibility of the database system. Expand
Optimism vs. locking: a study of concurrency control for client-server object-oriented databases
TLDR
A new optimistic concurrency control scheme called AOCC ( Adaptive Optimistic Concurrency Control) is described and its performance is compared with that of ACBL (Adaptive-Granularity Callback Locking), the scheme shown to have the best performance in previous studies. Expand
Managing update conflicts in Bayou, a weakly connected replicated storage system
TLDR
The motivation for and design of these mechanisms for conflict detection and per -write conflict resolution based on client-provid ed procedures are presented and the experiences gained with an initial implementation of the system are described. Expand
A theoretical formulation for degrees of isolation in databases
TLDR
This paper formulates different degrees of isolation in terms of histories, as in the case of the usual serialization theory and proposes timestamp-based protocols for different degrees, which can improve response time of a database system. Expand
The serializability of concurrent database updates
TLDR
Several efficiently recognizable subclasses of the class of senahzable histories are introduced and it is shown how these results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems. Expand
Efficient optimistic concurrency control using loosely synchronized clocks
TLDR
An efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines while persistent storage and transactional support are provided by servers, which outperforms adaptive callback locking for low to moderate contention workloads, and scales better with the number of clients. Expand
A new distributed optimistic concurrency control method and a comparison of its performance with two-phase locking
TLDR
A distributed optimistic concurrency control method followed by locking, such that locking is an integral part of distributed validation and two-phase commit is presented, showing that in the case of higher data contention levels, the hybrid OCC method allows a much higher maximum transaction throughput than distributed 2PL. Expand
...
1
2
3
4
5
...