Affiliation:
1. Massachusetts Computer Associates, Inc.
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.
Publisher
Association for Computing Machinery (ACM)
Reference4 articles.
1. Lamport L. The implementation of reliable distributed multiprocess systems. To appear in Computer Networks. Lamport L. The implementation of reliable distributed multiprocess systems. To appear in Computer Networks.
2. Dissemination of System Time
Cited by
4687 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Detecting causality in the presence of Byzantine processes: The case of synchronous systems;Information and Computation;2024-12
2. Logical Synchrony and the Bittide Mechanism;IEEE Transactions on Parallel and Distributed Systems;2024-11
3. Real-Time Guarantees for SLCS Monitors in XC;Proceedings of the 7th ACM International Workshop on Verification and Monitoring at Runtime Execution;2024-09-13
4. Optimising Aggregate Monitors for Spatial Logic of Closure Spaces Properties;Proceedings of the 7th ACM International Workshop on Verification and Monitoring at Runtime Execution;2024-09-13
5. Generalized Concurrency Testing Tool for Distributed Systems;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11