Keep CALM and CRDT On

by   Shadaj Laddad, et al.
berkeley college

Despite decades of research and practical experience, developers have few tools for programming reliable distributed applications without resorting to expensive coordination techniques. Conflict-free replicated datatypes (CRDTs) are a promising line of work that enable coordination-free replication and offer certain eventual consistency guarantees in a relatively simple object-oriented API. Yet CRDT guarantees extend only to data updates; observations of CRDT state are unconstrained and unsafe. We propose an agenda that embraces the simplicity of CRDTs, but provides richer, more uniform guarantees. We extend CRDTs with a query model that reasons about which queries are safe without coordination by applying monotonicity results from the CALM Theorem, and lay out a larger agenda for developing CRDT data stores that let developers safely and efficiently interact with replicated application state.


page 1

page 2

page 3

page 4


Keeping CALM: When Distributed Consistency is Easy

A key concern in modern distributed systems is to avoid the cost of coor...

Verifying Strong Eventual Consistency in δ-CRDTs

Conflict-free replicated data types (CRDTs) are a natural structure with...

SCAR: Strong Consistency using Asynchronous Replication with Minimal Coordination

Data replication is crucial in modern distributed systems as a means to ...

On consistency types for lattice-based distributed programming languages

Distributed systems address an increasing demand for fast access to reso...

Non-uniform Replication

Replication is a key technique in the design of efficient and reliable d...

BuDDI: A Declarative Bloom Language for CALM Programming

Coordination protocols help programmers of distributed systems reason ab...

Quantifying and Generalizing the CAP Theorem

In distributed applications, Brewer's CAP theorem tells us that when net...

Please sign up or login with your details

Forgot password? Click here to reset