Berkeley algorithm

The Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was developed by Gusella and Zatti at the University of California, Berkeley in 1989 ^[1] and like Cristian's algorithm is intended for use within intranets.

The algorithm

Unlike Cristian's algorithm, the server process in the Berkeley algorithm, called the master, periodically polls other slave processes. Generally speaking, the algorithm is:

A master is chosen via an election process such as Chang and Roberts algorithm.
The master polls the slaves who reply with their time in a similar way to Cristian's algorithm.

References

^ Gusella, R.; Zatti, S. (1989), "The accuracy of the clock synchronization achieved by TEMPO in Berkeley UNIX 4.3BSD", Software Engineering, IEEE Transactions on, 15 (7), IEEE: 847–853, doi:10.1109/32.29484{{citation}}: CS1 maint: multiple names: authors list (link)

[1] Gusella, R.; Zatti, S. (1989), "The accuracy of the clock synchronization achieved by TEMPO in Berkeley UNIX 4.3BSD", Software Engineering, IEEE Transactions on, 15 (7), IEEE: 847–853, doi:10.1109/32.29484{{citation}}: CS1 maint: multiple names: authors list (link)

[1]