Random Distributed Algorithms For Clock Synchronization

Show simple item record

contributor.author Nakai, Shoichiro en_US
date.accessioned 2009-11-25T13:03:15Z en_US
date.available 2009-11-25T13:03:15Z en_US
date.issued 1992 en_US
identifier.citation Engineering Journal of Qatar University, 1992, Vol. 5, Pages 145-162. en_US
identifier.uri http://hdl.handle.net/10576/7827 en_US
description.abstract This paper proposes clock synchronization algorithms based on the idea in which randomly chosen m out of the total N processors cooperate to perform the clock adjustment of all processors in a distributed system. Selection of m processors is performed in a fully distributed way. Two types of algorithm which include different random mechanisms of processor selection are described. In the first algorithm, all processors adjust their clocks to the average of received clock signals issued by randomly chosen m processors. In the second algorithm, each processor chooses m processors randomly at its own will and adjust its own clock to the average of the chosen processor clocks. Fault tolerance against processor or link failure is taken into account in both algorithms. These algorithms exhibit desirable features in practical sense like simplicity in implementation, a small number of message exchanged, etc., so that the algorithms can be applied to sufficiently large system. Transient and steady state performances of the proposed algorithms are verified through simulation. INTRODUCTION en_US
language.iso en en_US
publisher Qatar University en_US
subject Engineering: Research Teaching en_US
title Random Distributed Algorithms For Clock Synchronization en_US
type Article en_US
identifier.pagination 145-162 en_US
identifier.volume 5 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record