A convergence function for clock synchronization protocols
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A distributed fault-tolerant Convergence Function (CF) is proposed to resynchronize clocks with high precision. The CF can be used in conjunction with drift corrections which significantly increases the period between resynchronizations. This is important when clock drifts are large, because clock synchronization overhead then becomes intolerable. Clock differences are disseminated by a reliable message protocol after the clock valves are exchanged. All correct clocks then have identical copies of a matrix of clock differences. Matrix elements of correct clocks satisfy several relations. A subset of clocks that satisfy these relations defines an average clock. The influence of incorrect clocks on the average clock is shown to be bounded. The resynchronization is precise if clock reading errors are small, including uncertainties in transmission delays. Incorrect clocks may run too slow or too fast, exhibit omission failures or report inconsistent values.Keywords
This publication has 8 references indexed in Scilit:
- A posteriori agreement for fault-tolerant clock synchronization on broadcast networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Probabilistic clock synchronization in large distributed systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- THE DEDOS ON-LINE SCHEDULERPublished by Elsevier ,1992
- A static scheduling algorithm for distributed hard real-time systemsReal-Time Systems, 1991
- Probabilistic clock synchronizationDistributed Computing, 1989
- Optimal clock synchronizationJournal of the ACM, 1987
- Inexact agreementPublished by Association for Computing Machinery (ACM) ,1985
- Synchronizing clocks in the presence of faultsJournal of the ACM, 1985