Cristian's algorithm
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Cristian's algorithm (introduced by Flaviu Cristian in 1989) is a method for clock synchronization which can be used in many fields of distributive computer science but is primarily used in low-latency intranets. Cristian observed that this simple algorithm is probabilistic, in that it only achieves synchronization if the round-trip time (RTT) of the request is short compared to required accuracy. It also suffers in implementations using a single server, making it unsuitable for many distributive applications where redundancy may be crucial.
Cristian's algorithm (introduced by Flaviu Cristian in 1989) is a method for clock synchronization which can be used in many fields of distributive computer science but is primarily used in low-latency intranets. Cristian observed that this simple algorithm is probabilistic, in that it only achieves synchronization if the round-trip time (RTT) of the request is short compared to required accuracy. It also suffers in implementations using a single server, making it unsuitable for many distributive applications where redundancy may be crucial.
See also
Allan variance Berkeley algorithm Clock synchronization Daytime Protocol, older time synchronization protocol using TCP or UDP port 13 ICMP Timestamp and ICMP Timestamp Reply, older time synchronization protocol using ICMP International Atomic Time NTP pool, a collection of worldwide computers that provide a highly accurate time via the Network Time Protocol NTP server misuse and abuse ntpd, OpenNTPD and Ntpdate Precision Time Protocol Synchronization Time Protocol, older time synchronization protocol using TCP or UDP port 37 Time server
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1270331878 under CC BY-SA 4.0; modifications have been made.