- Clock Synchronization Logically
- t1, t2
- if the time is greater, this will be selected
- Max (local time, send time) + 1
- Vector Clock
- V[i] = V[i] + d (where d>0)
- Berkeley’s Algorithm
- In this algorithm, let
- 40 / 4 = 10
- 3:10
- Main server time: 3:00
- Host 1 time: 3:20, Host 2 time: 3:40, Host 3 time: 2:40
- Calculate Average:
- (20 + 40 + 40 + 0) / 4 = 10
- So now the server time is adjusted to: 3:10
- Now Add/Minus the host time for adjusting it to server time
- Host 1 3:20 - 10
- Host 2 3:40 - 30
- Host 3 2:40 + 30
- Cristian's Algorithm:
- Records the request and response time
- If there is a delay, such as an interrupt, it can be added into the total time taken
- Estimated d = (T1 - T0)/2
- If I is known, d = (T1-T0-i)/2
- I is interrupt
Recent Pastes