Logical clock


Topic | v1 | created by jjones |
Description

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).


Relations

e.g. Dotted version vector

The basic idea of Dotted Version Vectors (dvv) is to take a version vector (vv) and add the possibili...

e.g. Hybrid logical clock

Hybrid logical clock, HLC, combines the best of logical clocks and physical clocks. HLC captures the...

e.g. Lamport timestamp

The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of ev...

subtopic of Time in distributed systems

In distributed systems, time is a problem. Each computer has a clock built in, but those clocks are i...


Edit details Edit relations Attach new author Attach new topic Attach new resource
Resources