Add resource "Vector Clocks Revisited Part 2: Dotted Version Vectors" Accepted
Changes: 9
-
Add Vector Clocks Revisited Part 2: Dotted Version Vectors
- Title
-
- Unchanged
- Vector Clocks Revisited Part 2: Dotted Version Vectors
- Type
-
- Unchanged
- Blog post
- Created
-
- Unchanged
- 2015-11-10
- Description
-
- Unchanged
- Today’s blog post is going to describe the sibling explosion issue in more detail and how Riak and some leading distributed systems researchers came together to solve this problem using Dotted Version Vectors.
- Link
-
- Unchanged
- https://riak.com/posts/technical/vector-clocks-revisited-part-2-dotted-version-vectors/
- Identifier
-
- Unchanged
- no value
Resource | v1 | current (v1) -
Add Optimizing state-based CRDTs (part 2)
- Title
-
- Unchanged
- Optimizing state-based CRDTs (part 2)
- Type
-
- Unchanged
- Blog post
- Created
-
- Unchanged
- 2018-08-20
- Description
-
- Unchanged
- In this blog post we'll continue exploring the ideas behind optimizing state-based CRDTs.
- Link
-
- Unchanged
- https://bartoszsypytkowski.com/optimizing-state-based-crdts-part-2/
- Identifier
-
- Unchanged
- no value
Resource | v1 | current (v1) -
Add Dotted version vector
- Title
-
- Unchanged
- Dotted version vector
- Description
-
- Unchanged
- The basic idea of Dotted Version Vectors (dvv) is to take a version vector (vv) and add the possibility of representing an individual causal event — dot — separate from the rest of the contiguous events. The dot is kept separate from the causal past and it globally and uniquely identifies a write. This allows representing concurrent writes, on the same server, by having different dots.
- Link
-
- Unchanged
- https://haslab.uminho.pt/tome/files/dvvset-dais.pdf
Topic | v1 | current (v1) -
Add Logical clock
- Title
-
- Unchanged
- Logical clock
- Description
-
- Unchanged
- A logical clock is a mechanism for capturing chronological and causal relationships in a distributed system. Often, distributed systems may have no physically synchronous global clock. Fortunately, in many applications (such as distributed GNU make), if two processes never interact, the lack of synchronization is unobservable. Moreover, in these applications, it suffices for the processes to agree on the event ordering (i.e., logical clock) rather than the wall-clock time. The first logical clock implementation, the Lamport timestamps, was proposed by Leslie Lamport in 1978 (Turing Award in 2013).
- Link
-
- Unchanged
- https://en.wikipedia.org/?curid=1376887
Topic | v1 | current (v1) -
Add Dotted version vector treated in Vector Clocks Revisited Part 2: Dotted Version Vectors
- Current
- treated in
Topic to resource relation | v1 -
Add Dotted version vector treated in Optimizing state-based CRDTs (part 2)
- Current
- treated in
Topic to resource relation | v1 -
Add Lamport timestamp is Logical clock
- Current
- is
Topic to topic relation | v1 -
Add Hybrid logical clock is Logical clock
- Current
- is
Topic to topic relation | v1 -
Add Dotted version vector is Logical clock
- Current
- is
Topic to topic relation | v1