On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences
Journal of the ACM (JACM)
A new fault-tolerant algorithm for clock synchronization
Information and Computation
Tolerating failures of continuous-valued sensors
ACM Transactions on Computer Systems (TOCS)
Introduction to OSF DCE (rev. 1.0)
Introduction to OSF DCE (rev. 1.0)
Improved algorithms for synchronizing computer network clocks
IEEE/ACM Transactions on Networking (TON)
Lower bounds for convergence function based clock synchronization
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
New Hybrid Fault Models for Asynchronous Approximate Agreement
IEEE Transactions on Computers
Specification and Implementation of the Universal TimeCoordinated Synchronization Unit (UTCSU)
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part III
Interval-based Clock Synchronization
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part II
Global Positioning System (GPS) Time Dissemination for Real-Time Applications
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part I
An interval-based framework for clock rate synchronization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A Network Time Interface M-Module for Distributing GPS-Timeover LANs
Real-Time Systems - Selected papers from IFAC/IFIP workshops on real-time programming
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
The customizable fault/error model for dependable distributed systems
Theoretical Computer Science - Dependable computing
Fail-Awareness: An Approach to Construct Fail-Safe Applications
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Understanding Protocols for Byzantine Clock Synchronization
Understanding Protocols for Byzantine Clock Synchronization
Maintaining the time in a distributed system: an example of a loosely-coupled distributed service (synchronization, fault-tolerance, debugging)
How to reconcile fault-tolerant interval intersection with the Lipschitz condition
Distributed Computing
Hi-index | 0.00 |
We present description and analysis of a novel optimal precision clock synchronization algorithm (OP), which takes care of both precision and accuracy with respect to external time. It relies upon the generic interval-based algorithm of Schmid and Schossmaier [Real-Time Syst. 12 (2) (1997) 173] and utilizes a convergence function based on the orthogonal accuracy algorithm of Schmid [Chicago J. Theoret. Comput. Sci. 3 (2000) 3]. As far as precision is concerned, we show that OP achieves optimal worst case precision, optimal maximum clock adjustment, and optimal rate, as does the algorithm of Fetzer and Cristian [Proceedings of the 10th Annual IEEE Conference on Computer Assurance, Gaithersburg, MD, 1995]. However, relying upon a perception-based hybrid fault model and a fairly realistic system model, our results are valid for a wide variety of node and link faults and apply to very high-precision applications as well: Impairments due to clock granularity and discrete rate adjustment cannot be ignored here anymore. Our accuracy analysis focuses on the nodes' local accuracy interval, which provides the atop running application with an on-line bound on the current deviation from external time. We show that this bound could get larger than twice the necessary lower bound ("traditional accuracy"), hence OP is considerably suboptimal in this respect.