Lamport timestamp

Topic | v1 | created by jjones |

The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different nodes or processes will typically not be perfectly synchronized, this algorithm is used to provide a partial ordering of events with minimal overhead, and conceptually provide a starting point for the more advanced vector clock method. The algorithm is named after its creator, Leslie Lamport. Distributed algorithms such as resource synchronization often depend on some method of ordering events to function. For example, consider a system with two processes and a disk. The processes send messages to each other, and also send messages to the disk requesting access. The disk grants access in the order the messages were received.


used by Conflict-free replicated data type (CRDT)

In distributed computing, a conflict-free replicated data type (CRDT) is a data structure which can b...

is Logical clock

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

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

has official Time, clocks, and the ordering of events in a distributed system

The concept of one event happening before another in a distributed system is examined, and is shown t...

treated in Lamport Clock

Use logical timestamps as a version for a value to allow ordering of values across servers