Conflict-Aware Replicated Data Types
Nicholas V. Lewchenko, Arjun Radhakrishna, Akash Gaonkar, Pavol, \v{C}ern\'y

TL;DR
This paper introduces Conflict-Aware Replicated Data Types (CARDs), a more expressive class of data types that support conflicting operations while maintaining ease of programming and reasoning through the use of consistency guards.
Contribution
The paper proposes a novel framework for conflict-aware replicated data types that use consistency guards to simplify programming, reasoning, and conflict inference.
Findings
Supports conflicting operations with modular reasoning
Reduces complexity of invariant proofs
Enables algorithmic conflict inference
Abstract
We introduce Conflict-Aware Replicated Data Types (CARDs). CARDs are significantly more expressive than Conflict-free Replicated Data Types (CRDTs) as they support operations that can conflict with each other. Introducing conflicting operations typically brings the need to block an operation in at least some executions, leading to difficulties in programming and reasoning about correctness, as well as potential inefficiencies in implementation. The salient aspect of CARDs is that they allow ease of programming and reasoning about programs comparable to CRDTs, while enabling algorithmic inference of conflicts so that an operation is blocked only when necessary. The key idea is to have a language that allows associating with each operation a two-state predicate called {\em consistency guard} that relates the state of the replica on which the operation is executing to a global state…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Advanced Database Systems and Queries · Software System Performance and Reliability
