Association for Computing Machinery eBooks· 2019· Book chapter
Time, clocks, and the ordering of events in a distributed system
- 1,980citations
- 2019year
Short summary
A distributed algorithm for synchronizing logical clocks provides a total ordering of events, enabling solutions to synchronization problems and specialized physical clock synchronization with bounded desynchronization.
AI-generated from the title and abstract; the full text is not read.
Key points
- Events in a distributed system naturally form a partial ordering based on causality.
- A distributed algorithm synchronizes logical clocks to create a total ordering of all events.
- This total ordering simplifies solving distributed system synchronization problems.
- The algorithm can be specialized for physical clocks, yielding bounds on their desynchronization.
AI-generated from the title and abstract; the full text is not read.
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.
The authors' abstract, as published at the source. Association for Computing Machinery eBooks, 2019 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computer Networks and Communications
Computer Networks and CommunicationsComputer Science