Show simple item record

Author Nakai, Shoichiroen_US
Available date 2009-11-25T13:03:15Zen_US
Publication Date 1992en_US
Publication Name Engineering Journal of Qatar University
Citation Engineering Journal of Qatar University, 1992, Vol. 5, Pages 145-162.en_US
URI http://hdl.handle.net/10576/7827en_US
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.en_US
Language enen_US
Publisher Qatar Universityen_US
Subject Engineering: Research Teachingen_US
Title Random Distributed Algorithms For Clock Synchronizationen_US
Type Articleen_US
Pagination 145-162en_US
Volume Number 5en_US


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record