Jump to content

Logical clock

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by A5b (talk | contribs) at 23:15, 14 November 2014 (* [http://www.cs.uic.edu/~ajayk/Chapter3.pdf Chapter 3: Logical Time] // Ajay Kshemkalyani and Mukesh Singhal, Distributed Computing: Principles, Algorithms, and Systems, Cambridge University Press, 2008). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A logical clock is a mechanism for capturing chronological and causal relationships in a distributed system.

Logical clock algorithms of note are:

  • Lamport timestamps, which are monotonically increasing software counters.
  • Vector clocks, that allow for partial ordering of events in a distributed system.
  • Version vectors, order replicas, according to updates, in an optimistic replicated system.
  • Matrix clocks, an extension of vector clocks that also contains information about other processes' views of the system.