<P> 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 . Like Cristian's algorithm, it is intended for use within intranets . </P> <P> Unlike Cristian's algorithm, the server process in the Berkeley algorithm, called the master, periodically polls other slave processes . Generally speaking, the algorithm is: </P> <Ol> <Li> A master is chosen via an election process such as Chang and Roberts algorithm . </Li> <Li> The master polls the slaves who reply with their time in a similar way to Cristian's algorithm . </Li> <Li> The master observes the round - trip time (RTT) of the messages and estimates the time of each slave and its own . </Li> <Li> The master then averages the clock times, ignoring any values it receives far outside the values of the others . </Li> <Li> Instead of sending the updated current time back to the other process, the master then sends out the amount (positive or negative) that each slave must adjust its clock . This avoids further uncertainty due to RTT at the slave processes . </Li> </Ol> <Li> A master is chosen via an election process such as Chang and Roberts algorithm . </Li>

Berkeley algorithm for clock synchronization in distributed system
find me the text answering this question