Babaoglu, O. and R. Drummond. (Almost) no cost clock synchronization. Proc. Seventeenth Internmional Symposium on Fault-tolerant Computing, Pittsburgh, Penn., July 1987, IEEE Computer Society, 42-47.  Home/Search   Document Not in Database   Summary   Related Articles

....variance. Even when messages are routed through intermediate sites, delays due to queuing in sites doing relaying can be measured and recorded in the message and therefore can be accounted for. A variation on the clock reading scheme just given, used in the clock synchronization protocols of [Babaoglu Drummond 87] Cristian et al. 86] Halpem et al. 84] Lundelius Lynch 84] and [Srikanth Toueg 85] reduces the number of messages by half but can increase clock reading error. 8 Instead of requesting the time, each processor q periodically broadcasts its virtual clock value (includ ing ....

....Evidence, requires making an assumption about the number of faulty processors. SE2 is guaranteed to hold only ifN 2k l because then there are fewer than k l faulty processors and at least k l correct ones. Thus, fault tolerance degree k= N 1) 2. A similar scheme was late used in the protocol of [Babaoglu Drummond 87] 20 The fact that when some processor receives sufficient evidence according to SE2 it must have received a message from a correct processor means that the accuracy of SE2 is better than that of SE1. A scenario that achieves worst case accuracy with SE2 is given by the following. Suppose, P ....

Babaoglu, O. and R. Drummond. (Almost) no cost clock synchronization. Proc. Seventeenth Internmional Symposium on Fault-tolerant Computing, Pittsburgh, Penn., July 1987, IEEE Computer Society, 42-47.

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