Time, clocks, and the ordering of events in a distributed system
Communications of the ACM1978Vol. 21(7), pp. 558–565
Citations Over TimeTop 1% of 1978 papers
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.
Related Papers
- → Synchronizing Spatiotemporal Chaos in Coupled Nonlinear Oscillators(1996)99 cited
- → Self-synchronization and controlled synchronization of dynamical systems(1997)9 cited
- → New Control Design of Synchronization(2007)
- Synchronizing Chaos via APD and Activeoccasional Coupling(2001)
- The network synchronization drived by flow coupling(2007)