[EE physical Clock Synchronization : NTP * Clock synchronization is done by two methods : 1. Internal synchronization 2. External synchronization External synchronization ‘* Extemal synchronization refers to synchronization of process’ clocks Cj with am authoritative external source $. Let D > 0 be the synchronization bound and S be the source of UIC. Then |S()-C\(t)| < D for i= 1,2, ..., N and for all seal times t + We say that clocks C; are accurate within the bound of D. Derbuted Computing 2 onteat Time ara Glob internal synchronization ‘+ Internal synchronization refers to synchronization of process’ clocks C, with each other. Le! D > 0 be the synchronization bound and C, and Cy processes pi and pj. respectively + Then] CWC] € D for ij = 1, 2 dlocks C,.C, agree within the bound of D. are clocks at N and for all real times t We say that are intemally. synchronized are not necessarily extemally + Note that clocks th Synchronized. ie, eventhough they agree with each other, the drift collectively from the external source of fime. if the set of processes P (s synchronized externally within a bound D, itis also internally synchronized within bound 2D. Glock correctness 4 A hardware clock, His said to be correct if its drift rate is within a bound p > 0. (ep 10-6 sees) see, # This means that the errr in measuring the interval between real times Cand tis 1a)— 1) = +e" =D where U> 0 ther condition of munetonieity may suffice : 17> 2 CD > CA) that is, a clock: wnotonicity with a hardware clock that CDEH Leh dows mot obey’ its correctness condition. A elack's crash only ever advances and i runs fast by adjusting the values of « and { oA lty clock is one th re is said to occur when the clock stops ticking altogether, Arbitrary failure is any other failure eg. jumps in time. [ERI synchronization in a Synchronous System © gynchronous distributed system i one in which the following bounds are defined : L the time to exeemle each step of a process has known lower and upper bounds. Each message transmitted over a channel is received within a known bounded Lime Each process has a local clock whose drift rate from real time has a known, bound. One process p, sends its local time i Process py sends its local time t to process pa in a message m. The receiving Provess po could set ils clock 10 Ut tyana WHEE Tang {6 the fime to transmit m. Tyran is unknown but mi Trans = MAX, So, set Trane = min + max/2 and receiver's clock = t + (min + max) / 2 TECHNICAL PUBLICATIONS? - an up trust for bromedgeEEX] cristian's Method for Synchronizing Clocks ly if the round-trip is within a ¢ + ‘The clock requests time and synchronizes EKER christian's Algorithm + Christian's algorithm Is centralized passive time server type algorithm. thm for setting the time would be to simply issue a remote and obtain the time. © The simplest algo procedure call lo a time server «© Assumptions : There is a machine with WWV receiver, UTC . It is called the time server. which receives pr Algorithm = 1. A machine sends a request to the time server is the maximum difference allowed between a clock and the UTC. server sends a reply message with the current UTC when receives the at least every d/2r seconds, where d 2. The time request. 3. The machine measures the time delay between time serve's sending the message and the machine's receiving the message. Then, it uses the measure to adjust the clock. + Fig. 2.3.1 shows getting the current time from a time server. Both To and T, are measured with the same clock Cfent Time server =-~- —— Linterrupthanding time Time Fig. 2. «Both the starting time Tp and the ending time T, are measured using the same clock, so the arrival will be relatively accurate even if the sender's clock is off from UTC by a substantial amount. ‘+ The best estimate of the message propagation time = (Ty +Ty)/2 + The new time can be set to the time retumed by the server plus the time that elapsed since the server generated the timestamp : tr Trerver + (Ty +T1) 72 TECHNICAL PUBLICATIONS® - an up-thrust for knowledge Distnouted Computes 215 Logical Tina and Global Sint «Adjust the clock : 1. Ifthe local clock is faster than the UTC, add tess to the time memory for each clock tick, 2. If the local clock is slower than the UTC, add more to the time memory for each clock tick, « Cristian's algorithm suffers from the problem that afflicts all single-scrver algorithms : the server might fail and clock synchronization will be unavailable. It is also subject to malicious interference.