On the composability of consistency conditions

Authors:
Roy Friedman;Roman Vitenberg;Gregory Chockler
Affiliations:
Computer Science Department, Technion - The Israel Institute of Technology, Haifa 32000, Israel;Computer Science Department, Technion - The Israel Institute of Technology, Haifa 32000, Israel;Institute of Computer Science, The Hebrew University of Jerusalem, Givat Ram, Jerusalem 91904, Israel
Venue:
Information Processing Letters
Year:
2003

Citing 9
Cited 3

Lazy replication: exploiting the semantics of distributed services

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Sequential consistency versus linearizability

ACM Transactions on Computer Systems (TOCS)
A checkpoint protocol for an entry consistent shared memory system

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Limitations of fast consistency conditions for distributed shared memories

Information Processing Letters
Lazy release consistency for distributed shared memory

Lazy release consistency for distributed shared memory
A Correctness Condition for High-Performance Multiprocessors

SIAM Journal on Computing
Implementing a caching service a distributed COBRA objects

IFIP/ACM International Conference on Distributed systems platforms
Session Guarantees for Weakly Consistent Replicated Data

PDIS '94 Proceedings of the Third International Conference on Parallel and Distributed Information Systems
Consistency Conditions for a CORBA Caching Service

DISC '00 Proceedings of the 14th International Conference on Distributed Computing

From session guarantees to contract guarantees for consistency of SOA-compliant processing

ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
Multiwriter Consistency Conditions for Shared Memory Registers

SIAM Journal on Computing
On consistency of encrypted files

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper presents a formal framework, which is based on the notion of a serialization set , that enables to compose a set of consistency conditions into a more restrictive one. To exemplify the utility of this framework, a list of very basic consistency conditions is identified, and it is shown that various compositions of the basic conditions yield some of the most commonly used consistency conditions, such as sequential consistency, causal memory , and Pipelined RAM. The paper also lists several applications that can benefit from even weaker semantics than Pipelined RAM that can be expressed as a composition of a small subset of the basic conditions.