Database transaction models for advanced applications
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
ACM Transactions on Computer-Human Interaction (TOCHI)
Eventually-serializable data services
Theoretical Computer Science
X-ability: a theory of replication
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Grapevine: an exercise in distributed computing
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A taxonomy of correctness criteria in database applications
The VLDB Journal — The International Journal on Very Large Data Bases
Partial Replication in the Database State Machine
NCA '01 Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA'01)
ACM Computing Surveys (CSUR)
An efficient distributed algorithm for detection of knots and cycles in a distributed graph
IEEE Transactions on Parallel and Distributed Systems
Brief announcement: exploring the consistency problem space
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Draw-together: graphical editor for collaborative drawing
CSCW '06 Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work
Showing correctness of a replication algorithm in a component based system
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Scalable and topology-aware reconciliation on P2P networks
Distributed and Parallel Databases
PADS: a policy architecture for distributed storage systems
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
| Hi-index | 0.00 |
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.