Presentation is loading. Please wait.

Presentation is loading. Please wait.

Jenhui Chen Office number:

Similar presentations


Presentation on theme: "Jenhui Chen Office number:"— Presentation transcript:

1 Jenhui Chen Office number: 5990 http://www.csie.cgu.edu.tw/jhchen
Time and Global State Jenhui Chen Office number: 5990

2 Introduction Time is a quantity we often want to measure accurately.
Algorithms that depend upon clock synchronization have been developed for several problems in distribution. Dr. Jenhui Chen

3 Skew between computer clocks in a distributed system
Dr. Jenhui Chen

4 Clock synchronization using a time server
p Time server,S Dr. Jenhui Chen

5 An example synchronization subnet in an NTP implementation
1 2 3 Note: Arrows denote synchronization control, numbers denote strata. Dr. Jenhui Chen

6 Figure 10.4 Messages exchanged between a pair of NTP peers
-2 - 3 Server B Server A Time m m' Dr. Jenhui Chen

7 Figure 10.5 Events occurring at three processes
Dr. Jenhui Chen

8 Figure 10.6 Lamport timestamps for the events shown in Figure 10.5
Dr. Jenhui Chen

9 Figure 10.7 Vector timestamps for the events shown in Figure 10.5
Dr. Jenhui Chen

10 Figure 10.8 Detecting global properties
Dr. Jenhui Chen

11 Figure 10.9 Cuts Dr. Jenhui Chen

12 Figure 10.10 Chandy and Lamport’s ‘snapshot’ algorithm
Marker receiving rule for process pi On pi’s receipt of a marker message over channel c: if (pi has not yet recorded its state) it records its process state now; records the state of c as the empty set; turns on recording of messages arriving over other incoming channels; else pi records the state of c as the set of messages it has received over c since it saved its state. end if Marker sending rule for process pi After pi has recorded its state, for each outgoing channel c: pi sends one marker message over c (before it sends any other message over c). Dr. Jenhui Chen

13 Figure 10.11 Two processes and their initial states
Dr. Jenhui Chen

14 Figure 10.12 The execution of the processes in Figure 10.11
Dr. Jenhui Chen

15 Figure 10.13 Reachability between states in the snapshot algorithm
Dr. Jenhui Chen

16 Figure 10.14 Vector timestamps and variable values for the execution of Figure 10.9
Dr. Jenhui Chen

17 Figure 10.15 The lattice of global states for the execution of Figure 10.14
Dr. Jenhui Chen

18 Figure 10.16 Algorithms to evaluate possibly f and definitely f
Dr. Jenhui Chen

19 Figure 10.17 Evaluating definitely f
Dr. Jenhui Chen


Download ppt "Jenhui Chen Office number:"

Similar presentations


Ads by Google