Clock synchronization

From Wikipedia, the free encyclopedia

Clock synchronization is a problem from computer science and engineering which deals with the idea that internal clocks of several computers may differ. Even when initially set accurately, real clocks will differ after some amount of time due to clock drift, caused by clocks counting time at slightly different rates. There are several problems that occur as a repercussion of rate differences and several solutions, some being more appropriate than others in certain contexts.[1]

Contents

[edit] Problems

Besides the incorrectness of the time itself, there are problems associated with clock skew that take on more complexity in a distributed system in which several computers will need to realize the same global time.

For instance, in Unix systems the make command is used to compile new or modified code without the need to recompile unchanged code. The make command uses the clock of the machine it runs on to determine which source files need to be recompiled. If the sources reside on a separate file server and the two machines have unsynchronized clocks, the make program might not produce the correct results.

[edit] Solutions

In a centralized system the solution is trivial; the centralized server will dictate the system time. Cristian's algorithm and the Berkeley Algorithm are some solutions to the clock synchronization problem in a centralized server environment. In a distributed system the problem takes on more complexity because a global time is not easily known. The most used clock synchronization solution on the internet is the Internet Network Time Protocol (NTP) which is a layered client-server architecture based on UDP message passing. Lamport timestamps and Vector clocks are concepts of the logical clocks in distributed systems.

[edit] Cristian's algorithm

Cristian's algorithm relies on the existence of a time server.[2] The time server maintains its clock by using a radio clock or other accurate time source, then all other computers in the system stay synchronized with it. A time client will maintain its clock by making a procedure call to the time server. Variations of this algorithm make more precise time calculations by factoring in network propagation time.

[edit] Berkeley algorithm

This algorithm is more suitable for systems where a radio clock is not present, this system has no way of making sure of the actual time other than by maintaining a global average time as the global time. A time server will periodically fetch the time from all the time clients, average the results, and then report back to the clients the adjustment that needs be made to their local clocks to achieve the average. This algorithm highlights the fact that internal clocks may vary not only in the time they contain but also in the clock rate. Often, any client whose clock differs by a value outside of a given tolerance is disregarded when averaging the results. This prevents the overall system time from being drastically skewed due to one erroneous clock.

[edit] Clock Sampling Mutual Network Synchronization

This algorithm is a class of mutual network synchronization algorithm in which no master or reference clocks are needed. All clocks equally participate in the synchronization of the network by exchanging their timestamps using regular beacon packets. CS-MNS is suitable for distributed and mobile applications. It has been shown to be scalable, accurate in the order of few microseconds, and compatible to IEEE 802.11 and similar standards.[3]

[edit] See also

Time Portal

[edit] References

  1. ^ Tanenbaum, Andrew S.; Maarten van Steen (2002). Distributed Systems : Principles and Paradigms. Prentice Hall. ISBN 0-13-088893-1. 
  2. ^ Cristian, F. (1989), “Probabilistic clock synchronization”, Distributed Computing (Springer) 3 (3): 146-158, <http://www.springerlink.com/content/j5250h34013874jv/> 
  3. ^ Rentel, C. & Kunz, T. (2005), “A clock-sampling mutual network synchronization algorithm for wireless ad hoc networks”, IEEE Wireless Communications and Networking Conference (IEEE Press) 1: 638-644, <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1424575> 
Languages