Vector clock

src: thumbs.dreamstime.com

A vector clock is an algorithm for generating a partial ordering of events in a distributed system and detecting causality violations. Just as in Lamport timestamps, interprocess messages contain the state of the sending process's logical clock. A vector clock of a system of N processes is an array/vector of N logical clocks, one clock per process; a local "smallest possible values" copy of the global clock-array is kept in each process, with the following rules for clock updates:

• Initially all clocks are zero.
• Each time a process experiences an internal event, it increments its own logical clock in the vector by one.
• Each time a process sends a message, it increments its own logical clock in the vector by one (as in the bullet above) and then sends a copy of its own vector.
• Each time a process receives a message, it increments its own logical clock in the vector by one and updates each element in its vector by taking the maximum of the value in its own vector clock and the value in the vector in the received message (for every element).

The vector clocks algorithm was independently developed by Colin Fidge and Friedemann Mattern in 1988.

Video Vector clock

Partial ordering property

Vector clocks allow for the partial causal ordering of events. Defining the following:

• ${\displaystyle VC(x)}$ denotes the vector clock of event ${\displaystyle x}$, and ${\displaystyle VC(x)_{z}}$ denotes the component of that clock for process ${\displaystyle z}$.
• ${\displaystyle VC(x)<VC(y)\iff \forall z[VC(x)_{z}\leq VC(y)_{z}]\land \exists z'[VC(x)_{z'}<VC(y)_{z'}]}$
  • In English: ${\displaystyle VC(x)}$ is less than ${\displaystyle VC(y)}$, if and only if ${\displaystyle VC(x)_{z}}$ is less than or equal to ${\displaystyle VC(y)_{z}}$ for all process indices ${\displaystyle z}$, and at least one of those relationships is strictly smaller (that is, ${\displaystyle VC(x)_{z'}<VC(y)_{z'}}$).
• ${\displaystyle x\to y\;}$ denotes that event ${\displaystyle x}$ happened before event ${\displaystyle y}$. It is defined as: if ${\displaystyle x\to y\;}$, then ${\displaystyle VC(x)<VC(y)}$

Properties:

• If ${\displaystyle VC(a)<VC(b)}$, then ${\displaystyle a\to b\;}$
• Antisymmetry: if ${\displaystyle VC(a)<VC(b)}$, then ¬${\displaystyle (VC(b)<VC(a))}$
• Transitivity: if ${\displaystyle VC(a)<VC(b)}$ and ${\displaystyle VC(b)<VC(c)}$, then ${\displaystyle VC(a)<VC(c)}$ or if ${\displaystyle a\to b\;}$ and ${\displaystyle b\to c\;}$, then ${\displaystyle a\to c\;}$

Relation with other orders:

• Let ${\displaystyle RT(x)}$ be the real time when event ${\displaystyle x}$ occurs. If ${\displaystyle VC(a)<VC(b)}$, then ${\displaystyle RT(a)<RT(b)}$
• Let ${\displaystyle C(x)}$ be the Lamport timestamp of event ${\displaystyle x}$. If ${\displaystyle VC(a)<VC(b)}$, then ${\displaystyle C(a)<C(b)}$

Maps Vector clock

Other mechanisms

• Almeida et al., introduced in 2008 Interval Tree Clocks. This mechanism generalizes Vector Clocks and allows operation in dynamic environments when the identities and number of processes in the computation is not known in advance. You can find an implementation of ITC named itc4j here.

• Torres-Rojas and Ahamad, developed in 1999 Plausible Clocks, a mechanism that takes less space than vector clocks but that, in some cases, will totally order events that are causally concurrent.

src: previews.123rf.com

See also

• Lamport timestamps
• Matrix clocks
• Version vector

src: previews.123rf.com

References

src: www.featurepics.com

External links

• Why Logical Clocks are Easy (Compares Causal Histories, Vector Clocks and Version Vectors)
• Explanation of Vector clocks
• Timestamp-based vector clock implementation in Erlang
• Vector clock implementation in Objective-C
• Vector clock implementation in Erlang
• Why Vector Clocks are Hard
• Riak Vector Clocks
• Why Cassandra doesn't need vector clocks

Source of the article : Wikipedia