Journal of the ACM (JACM)
Simulating synchronized clocks and common knowledge in distributed systems
Journal of the ACM (JACM)
Optimal clock synchronization under different delay assumptions
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Theoretical Computer Science
A theory of clock synchronization (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Time/contention trade-offs for multiprocessor synchronization
Information and Computation
Forward and backward simulations I.: untimed systems
Information and Computation
Forward and backward simulations II.: timing-based systems
Information and Computation
Liveness in timed and untimed systems
Information and Computation
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Closed form bounds for clock synchronization under simple uncertainty assumptions
Information Processing Letters
Distributed Algorithms
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
IEEE Transactions on Computers
An Overview of Clock Synchronization
Proceedings of the Asilomar Workshop on Fault-Tolerant Distributed Computing
Time-Constrained Automata (Extended Abstract)
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A new fault-tolerant algorithm for clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Optimal clock synchronization revisited: upper and lower bounds in real-time systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Failure detection with booting in partially synchronous systems
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Implementing reliable distributed real-time systems with the Θ-model
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Optimal Deterministic Remote Clock Estimation in Real-Time Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Reconciling fault-tolerant distributed algorithms and real-time computing
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Hi-index | 5.23 |
This paper introduces a simple real-time distributed computing model for message-passing systems, which reconciles the distributed computing and the real-time systems perspective: By just replacing instantaneous computing steps with computing steps of non-zero duration, we obtain a model that both facilitates real-time scheduling analysis, and retains compatibility with classic distributed computing analysis techniques and results. We provide general simulations and validity conditions for transforming algorithms from the classic synchronous model to our real-time model and vice versa, and investigate whether/which properties of real systems are inaccurately or even wrongly captured when resorting to zero step-time models. We revisit the well-studied problem of deterministic drift- and failure-free internal clock synchronization for this purpose, and show that no clock synchronization algorithm with constant running time can achieve optimal precision in our real-time model. Since such an algorithm is known for the classic model, this is an instance of a problem where the standard distributed computing analysis gives too optimistic results. We prove that optimal precision is only achievable with algorithms that take @W(n) time in our model, and establish several additional algorithms and lower bounds.