Editing Logical clock (section)

{{Short description|Mechanism for capturing chronological and causal relationships}}
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. In many applications (such as distributed [[GNU make]]), if two processes never interact, the lack of synchronization is unobservable and in these applications it is enough for the processes to agree on the event ordering (i.e., logical clock) rather than the wall-clock time.<ref>{{Cite web|title=Distributed Systems 3rd edition (2017)|url=https://www.distributed-systems.net/index.php/books/ds3/|access-date=2021-03-20|website=DISTRIBUTED-SYSTEMS.NET|language=en-US}}</ref> The first logical clock implementation, the [[Lamport timestamps]], was proposed by [[Leslie Lamport]] in 1978 ([[Turing Award]] in 2013).