An overview of clock synchronization
Fault-tolerant distributed computing
Optimal clock synchronization under different delay assumptions
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
A theory of clock synchronization (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Closed form bounds for clock synchronization under simple uncertainty assumptions
Information Processing Letters
Distributed Algorithms
A new fault-tolerant algorithm for clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
The Asynchronous Bounded-Cycle Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security 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
Towards a real-time distributed computing model
Theoretical Computer Science
The Asynchronous Bounded-Cycle model
Theoretical Computer Science
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 | 0.00 |
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. As a by-product, it also allows us to 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 internal clock synchronization for this purpose, and show that, contrary to the classic model, no clock synchronization algorithm with constant running time can achieve optimal precision in our real-time model. We prove that optimal precision is only achievable with algorithms that take Ω(n) time in our model, and establish several additional lower bounds and algorithms.