Metraipolis › archive › dc_f600d55e5af6

Lamport timestamp — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Lamport_timestamp
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T14:51:11.507Z
SHA-256 of the archived text
66475148a402d5615002699c0f136f02d81f7d39bb2afc79e220479542c770f4
Stable URL of this page
https://metraipolis.com/documento/dc_f600d55e5af6

How to cite

Lamport timestamp — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Lamport_timestamp (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_f600d55e5af6 (Metraipolis archive dc_f600d55e5af6, sha256 66475148a402d5615002699c0f136f02d81f7d39bb2afc79e220479542c770f4)
BibTeX
@misc{dcf600d55e5af6,
  title = {Lamport timestamp — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Lamport_timestamp},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_f600d55e5af6; sha256 66475148a402d5615002699c0f136f02d81f7d39bb2afc79e220479542c770f4},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Lamport_timestamp. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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. For example process A {\displaystyle A} sends a message to the disk requesting write access, and then sends a read instruction message to process B {\displaystyle B} . Process B {\displaystyle B} receives the message, and as a result sends its own read request message to the disk. If there is a timing delay causing the disk to receive both messages at the same time, it can determine which message happened-before the other: A {\displaystyle A} happens-before B {\displaystyle B} if one can get from A {\displaystyle A} to B {\displaystyle B} by a sequence of moves of two types: moving forward while remaining in the same process, and following a message from its sending to its reception. A logical clock algorithm provides a mechanism to determine facts about the order of such events. Note that if two events happen in different processes that do not exchange messages directly or indirectly via third-party processes, then we say that the two processes are concurrent, that is, nothing can be said about the ordering of the two events. Lamport invented a simple mechanism by which the happened-before ordering can be captured numerically. A Lamport logical clock is a numerical software counter value maintained in each process. Conceptually, this logical clock can be thought of as a clock that only has meaning in relation to messages moving between processes. When a process receives a message, it re-synchronizes its logical clock with that sender. The above-mentioned vector clock is a generalization of the idea into the context of an arbitrary number of parallel, independent processes.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «timestamping»).
Fonte: Wikipedia in inglese, voce «Lamport timestamp» — https://en.wikipedia.org/wiki/Lamport_timestamp
Wikidata Q1801707 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1801707
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Lamport_timestamp?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1359416476, consultata il 2026-10-15T14:02:53.071Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 668e7e4113aecb29c536fcfdf26b12bb72caab0543880158dc299f94c45a1ca5