English
Related papers

Related papers: Efficient State-based CRDTs by Delta-Mutation

200 papers

CRDTs are distributed data types that make eventual consistency of a distributed object possible and non ad-hoc. Specifically, state-based CRDTs ensure convergence through disseminating the entire state, that may be large, and merging it to…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-17 Paulo Sérgio Almeida , Ali Shoker , Carlos Baquero

Conflict-free Replicated Data Types (CRDTs) allow optimistic replication in a principled way. Different replicas can proceed independently, being available even under network partitions, and always converging deterministically: replicas…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-09-10 Paulo Sérgio Almeida

To ensure high availability in large scale distributed systems, Conflict-free Replicated Data Types (CRDTs) relax consistency by allowing immediate query and update operations at the local replica, with no need for remote synchronization.…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-03-12 Vitor Enes , Paulo Sérgio Almeida , Carlos Baquero , João Leitão

Distributed systems designed to serve clients across the world often make use of geo-replication to attain low latency and high availability. Conflict-free Replicated Data Types (CRDTs) allow the design of predictable multi-master…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-13 Carlos Baquero , Paulo Sergio Almeida , Ali Shoker

Conflict-free replicated data types (CRDTs) are distributed data structures designed for fault tolerance and high availability. CRDTs have historically been taxonomized into state-based CRDTs, in which replicas apply updates locally and…

Programming Languages · Computer Science 2025-08-14 Nathan Liittschwager , Jonathan Castello , Stelios Tsampas , Lindsey Kuper

Conflict-free replicated data types (CRDTs) are a natural structure with which to communicate information about a shared computation in a distributed setting where coordination overhead may not be tolerated, and individual participants are…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-18 Taylor Blau

Internet-scale distributed systems often replicate data at multiple geographic locations to provide low latency and high availability, despite node and network failures. Geo-replicated systems that adopt a weak consistency model allow…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-06-28 Nuno Preguiça

A conflict-free replicated data type (CRDT) is an abstract data type, with a well defined interface, designed to be replicated at multiple processes and exhibiting the following properties: (1) any replica can be modified without…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-06-22 Nuno Preguiça , Carlos Baquero , Marc Shapiro

Operation-based Conflict-free Replicated Data Types (CRDTs) are eventually consistent replicated data types that automatically resolve conflicts between concurrent operations. Op-based CRDTs must be designed differently for each data type,…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-10 Matthew Weidner , Heather Miller , Christopher Meiklejohn

A CRDT is a data type whose operations commute when they are concurrent. Replicas of a CRDT eventually converge without any complex concurrency control. As an existence proof, we exhibit a non-trivial CRDT: a shared edit buffer called…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-07-07 Mihai Letia , Nuno Preguiça , Marc Shapiro

Maintaining multiple replicas of data is crucial to achieving scalability, availability and low latency in distributed applications. Conflict-free Replicated Data Types (CRDTs) are important building blocks in this domain because they are…

Programming Languages · Computer Science 2019-05-15 Kartik Nagar , Suresh Jagannathan

Trees are fundamental data structure for many areas of computer science and system engineering. In this report, we show how to ensure eventual consistency of optimistically replicated trees. In optimistic replication, the different replicas…

Data Structures and Algorithms · Computer Science 2012-01-10 Stéphane Martin , Mehdi Ahmed-Nacer , Pascal Urso

In Opportunistic Networks (OppNets), the dissemination of information can only rely on transient pairwise radio contacts between mobile devices (peers). Designing distributed applications that can run in such conditions is a challenge, but…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-22 Frédéric Guidec , Yves Mahéo

Data replication is used in distributed systems to maintain up-to-date copies of shared data across multiple computers in a network. However, despite decades of research, algorithms for achieving consistency in replicated systems are still…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-08-30 Victor B. F. Gomes , Martin Kleppmann , Dominic P. Mulligan , Alastair R. Beresford

Geo-distributed systems often replicate data at multiple locations to achieve availability and performance despite network partitions. These systems must accept updates at any replica and propagate these updates asynchronously to every…

Programming Languages · Computer Science 2019-03-18 Constantin Enea , Suha Orhun Mutluergil , Gustavo Petri , Chao Wang

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…

Databases · Computer Science 2022-10-25 Shadaj Laddad , Conor Power , Mae Milano , Alvin Cheung , Natacha Crooks , Joseph M. Hellerstein

Collaborative Data Sharing is widely noticed to be essential for distributed systems. Among several proposed strategies, conflict-free techniques are considered useful for serverless concurrent systems. They aim at making shared data be…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-12-02 Masato Takeichi

We introduce Coordination-free Collaborative Replication (CCR), a new method for maintaining consistency across replicas in distributed systems without requiring explicit coordination messages. CCR automates conflict resolution, contrasting…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-12-17 Masato Takeichi

State-based Conflict-free Replicated Data Types (CRDTs) are widely used in distributed systems to ensure high availability without coordination. However, their naive synchronization strategy - transmitting the full state - incurs high…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-05 Pedro Silva Gomes , Miguel Boaventura Rodrigues , Carlos Baquero

Replication ensures data availability in fault-prone distributed systems. The celebrated CAP theorem stipulates that replicas cannot guarantee both strong consistency and availability under network partitions. A popular alternative, adopted…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-22 Petr Kuznetsov , Maxence Perion , Sara Tucci-Piergiovanni
‹ Prev 1 2 3 10 Next ›