Fault-tolerant clock synchronization in distributed systems
- 1 October 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 23 (10) , 33-42
- https://doi.org/10.1109/2.58235
Abstract
Existing fault-tolerant clock synchronization algorithms are compared and contrasted. These include the following: software synchronization algorithms, such as convergence-averaging, convergence-nonaveraging, and consistency algorithms, as well as probabilistic synchronization; hardware synchronization algorithms; and hybrid synchronization. The worst-case clock skews guaranteed by representative algorithms are compared, along with other important aspects such as time, message, and cost overhead imposed by the algorithms. More recent developments such as hardware-assisted software synchronization and algorithms for synchronizing large, partially connected distributed systems are especially emphasized.Keywords
This publication has 11 references indexed in Scilit:
- A new fault-tolerant algorithm for clock synchronizationInformation and Computation, 1988
- Synchronization of fault-tolerant clocks in the presence of malicious failuresIEEE Transactions on Computers, 1988
- Transmission delays in hardware clock synchronizationIEEE Transactions on Computers, 1988
- Optimal clock synchronizationJournal of the ACM, 1987
- Clock Synchronization of a Large Multiprocessor System in the Presence of Malicious FaultsIEEE Transactions on Computers, 1987
- Ensuring Fault Tolerance of Phase-Locked ClocksIEEE Transactions on Computers, 1985
- Synchronizing clocks in the presence of faultsJournal of the ACM, 1985
- Fault-tolerant clock synchronizationPublished by Association for Computing Machinery (ACM) ,1984
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- FTMP—A highly reliable fault-tolerant multiprocess for aircraftProceedings of the IEEE, 1978