Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems

Abstract

AbstractThis 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.KeywordsSchedule PolicyClock SynchronizationComputing StepMessage DelayTime MessageThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.