Time, clocks, and the ordering of events in a distributed system
Abstract
The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering is illustrated with a method for solving synchronization problems. The algorithm is then specialized for synchronizing physical clocks, and a bound is derived on how far out of synchrony the clocks can become.
A lawful full-text candidate was found, but the source was temporarily unreachable. The worker can retry later.
No local PDF is available.
GROBID Extracted text; discontinued.
This text is generated from TEI extraction for accessibility, search, and TTS. Formulas, tables, figures, page layout, and references may not perfectly match the original PDF.
No accessible text representation is available. The text extraction service has been discontinued for the time being. If you require this service, for accessibility or any other reason, please submit an issue/request on this page.
Metadata
Full-text discovery attempts
| Provider | Status | Kind | URL | Reason |
|---|---|---|---|---|
| crossref_resource | failed | https://dl.acm.org/doi/10.1145/359545.359563 | Source returned HTTP 403. | |
| crossref_link | failed | https://dl.acm.org/doi/pdf/10.1145/359545.359563 | Source returned HTTP 403. | |
| doi_landing | failed | html | https://doi.org/10.1145/359545.359563 | Source returned HTTP 403. |
Issues
No public issues have been filed for this DOI.
Submit an issue
Record history
No public record history yet.