Recent demands for storing and querying big data have revealed various shortcomings of
traditional relational database systems. This, in turn, has led to the emergence of a new kind …

In distributed applications, Brewer's CAP theorem tells us that when networks become
partitioned (P), one must give up either consistency (C) or availability (A). Consistency is …

To ease the development of geo-distributed applications, replicated data types (RDTs) offer
a familiar programming interface while ensuring state convergence, low latency, and high …

Open-source software communities, platform ecosystems, and blockchains exemplify some
novel organizational forms made possible through recent technological innovations and …

MongoDB is a distributed database that supports replication and horizontal partitioning
(sharding). MongoDB replica sets consist of a primary that accepts all client writes and then …

In distributed applications, Brewer's CAP theorem tells us that when networks become
partitioned (P), one must give up either consistency (C) or availability (A). Consistency is …

Distributed Systems: Concurrency and Consistency explores the gray area of distributed
systems and draws a map of weak consistency criteria, identifying several families and …

Distributed systems adopt weak consistency to ensure high availability and low latency, but
state convergence is hard to guarantee due to conflicts. Experts carefully design replicated …

Developers of modern distributed systems continuously face the impossibility result proved
by the CAP theorem. In a nutshell, the theorem states that a partition-tolerant system can …

We define am axiomatic timeless framework for asynchronous distributed systems, together
with well-formedness and consistency axioms, which unifies and generalizes the expressive …