A Constraint-based Formalism for Consistency in Replicated Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

A Constraint-based Formalism for Consistency in Replicated Systems

(1) , (2) , (3)


We present a formalism for modeling replication in a distributed system with concurrent users sharing information. It is based on actions, which represent operations requested by independent users, and constraints, representing scheduling relations between actions. The formalism encompasses semantics of shared data, such as commutativity or conflict between actions, and user intents such as causal dependence or atomicity. It enables us to reason about the consistency properties of a replication protocol or of classes of protocols. It supports weak consistency (optimistic protocols) as well as the stronger pessimistic protocols. Our approach clarifies the requirements and assumptions common to all replication systems. We are able to prove a number of common properties. For instance consistency properties that appear different operationally are proved equivalent under suitable liveness assumptions. The formalism enables us to design a new, generalised peer-to-peer consistency protocol.
Fichier principal
Vignette du fichier
opodis2004-final-2004-10-30.pdf (154.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00444799 , version 1 (07-01-2010)



Marc Shapiro, Karthikeyan Bhargavan, Nishith Krishna. A Constraint-based Formalism for Consistency in Replicated Systems. OPODIS 2004 - 8th International Conference on Principles of Distributed Systems, Dec 2004, Grenoble, France. pp.331--345, ⟨10.1007/11516798_24⟩. ⟨inria-00444799⟩
310 View
216 Download



Gmail Facebook Twitter LinkedIn More