Add resource "A comprehensive study of Convergent and Commutative Replicated Data Types" Accepted
The requested resource couldn't be found.
Changes: 11
-
Add A comprehensive study of Convergent and Commutative Replicated Data Types
- Title
-
- Unchanged
- A comprehensive study of Convergent and Commutative Replicated Data Types
- Type
-
- Unchanged
- Paper
- Created
-
- Unchanged
- 2011-01-13
- Description
-
- Unchanged
- Eventual consistency aims to ensure that replicas of some mutable shared object converge without foreground synchronisation. Previous approaches to eventual consistency are ad-hoc and error-prone. We study a principled approach: to base the design of shared data types on some simple formal conditions that are sufficient to guarantee eventual consistency. We call these types Convergent or Commutative Replicated Data Types (CRDTs). This paper formalises asynchronous object replication, either state based or operation based, and provides a sufficient condition appropriate for each case. It describes several useful CRDTs, including container data types supporting both \add and \remove operations with clean semantics, and more complex types such as graphs, montonic DAGs, and sequences. It discusses some properties needed to implement non-trivial CRDTs.
- Link
-
- Unchanged
- https://hal.inria.fr/inria-00555588
- Identifier
-
- Unchanged
- no value
Resource | v1 | current (v1) -
Add Composing and decomposing op-based CRDTs with semidirect products
- Title
-
- Unchanged
- Composing and decomposing op-based CRDTs with semidirect products
- Type
-
- Unchanged
- Paper
- Created
-
- Unchanged
- 2020-08-02
- Description
-
- Unchanged
- 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, and current designs use ad-hoc techniques to handle concurrent operations that do not naturally commute. We present a new construction, the semidirect product of op-based CRDTs, which combines the operations of two CRDTs into one while handling conflicts between their concurrent operations in a uniform way. We demonstrate the construction's utility by using it to construct novel CRDTs, as well as decomposing several existing CRDTs as semidirect products of simpler CRDTs. Although it reproduces common CRDT semantics, the semidirect product can be viewed as a restricted kind of operational transformation, thus forming a bridge between these two opposing techniques for constructing replicated data types.
- Link
-
- Unchanged
- https://doi.org/10.1145/3408976
- Identifier
-
- Unchanged
- no value
Resource | v1 | current (v1) -
Add Time, clocks, and the ordering of events in a distributed system
- Title
-
- Unchanged
- Time, clocks, and the ordering of events in a distributed system
- Type
-
- Unchanged
- Paper
- Created
-
- Unchanged
- 2019-10-04
- Description
-
- Unchanged
- The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
- Link
-
- Unchanged
- https://doi.org/10.1145/3335772.3335934
- Identifier
-
- Unchanged
- ISBN: 9781450372701
Resource | v1 | current (v1) -
Add Lamport timestamp
- Title
-
- Unchanged
- Lamport timestamp
- Description
-
- Unchanged
- The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different nodes or processes will typically not be perfectly synchronized, this algorithm is used to provide a partial ordering of events with minimal overhead, and conceptually provide a starting point for the more advanced vector clock method. The algorithm is named after its creator, Leslie Lamport. Distributed algorithms such as resource synchronization often depend on some method of ordering events to function. For example, consider a system with two processes and a disk. The processes send messages to each other, and also send messages to the disk requesting access. The disk grants access in the order the messages were received.
- Link
-
- Unchanged
- https://en.wikipedia.org/?curid=2173021
Topic | v1 | current (v1) -
Add Conflict-free replicated data type (CRDT) treated in A comprehensive study of Convergent and Commutative Replicated Data Types
- Current
- treated in
Topic to resource relation | v1 -
Add Conflict-free replicated data type (CRDT) treated in Composing and decomposing op-based CRDTs with semidirect products
- Current
- treated in
Topic to resource relation | v1 -
Add Lamport timestamp has official Time, clocks, and the ordering of events in a distributed system
- Current
- has official
Topic to resource relation | v1 -
Add Conflict-free replicated data type (CRDT) uses Lamport timestamp
- Current
- uses
Topic to topic relation | v1 -
Add CRDTs: Part 1 references A comprehensive study of Convergent and Commutative Replicated Data Types
- Current
- references
Resource to resource relation | v1 -
Add CRDTs: Part 1 references Time, clocks, and the ordering of events in a distributed system
- Current
- references
Resource to resource relation | v1 -
Add CRDTs: Part 1 references Composing and decomposing op-based CRDTs with semidirect products
- Current
- references
Resource to resource relation | v1