J. Lundelius, N. Lynch: A new failure-tolerant algorithm for clock synchronization, Proc. of the 3rd ACM Symposium on Principles of Distributed Computing, 1983.  Home/Search   Document Not in Database   Summary   Related Articles

....failures that do not partition the network of correct processors. We acknowledge the possibility that other types of failures (e.g. very fast clocks, or sabotaged processors) Such failures can in principle occur, and there are several more complex protocols that have been designed to handle them [LM,LL,DHSS]. We have chosen improved simplicity and performance at the expense of a chance of loss of synchronization in the presence of these rare failure types. Thus, rather than aiming at generality and power, the goal was to favor simplicity and practicality and to aim for those applications where the ....

....problem of synchronizing the clocks of a distributed system in the presence of likely failures such as omission and performance failures, and in the presence of processor joins. Because of the simpler failure model considered, the protocol presented is considerably simpler then those presented in [LM,DHSS,LL], especially in the handling of processor joins. The engineering approach adopted is similar in spirit to the one adopted in [KO] where protocol simplicity is achieved by limiting the total number of failures that can be tolerated during a synchronization. Synchronized clocks are useful for a ....

J. Lundelius, N. Lynch: A new failure-tolerant algorithm for clock synchronization, Proc. of the 3rd ACM Symposium on Principles of Distributed Computing, 1983.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC