Download
slide1 n.
Skip this Video
Loading SlideShow in 5 Seconds..
CSS434 Time and Global States Textbook Ch11 PowerPoint Presentation
Download Presentation
CSS434 Time and Global States Textbook Ch11

CSS434 Time and Global States Textbook Ch11

426 Views Download Presentation
Download Presentation

CSS434 Time and Global States Textbook Ch11

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. CSS434 Time and Global States Textbook Ch11 Professor: Munehiro Fukuda CSS434 Time & Global States

  2. Outline • Physical clock synchronization • Applications: make • Logical clock synchronization • Parallel and distributed simulation • Global states and consistent cuts • Distributed garbage collection, deadlock detection, distributed termination detection, and discrete-even simulation • Distributed debugging • Checking if a captured snapshot is one of transitory states we have considered. CSS434 Time & Global States

  3. Why Clock Synchronization • Computer clock: a counter decremented by a crystal oscillation. • Single computers: all processes use the same clock. – No problem • Multiple computers: impossible to guarantee that the crystals in different computers all run at exactly the same frequency. • Synchronization: • Absolute (with real time) • Necessary for real-time applications such as on-line reservation systems • Relative (with each other) • Required for those applications that need a consistent view of time across all nodes. CSS434 Time & Global States

  4. Clock SynchronizationPassive Centralized Algorithms – Christian’s Algorithm T1 T0 • Assumption: processing time has been measured or estimated • Message_delay = (T1 – T0 – processing)/2 • New client time = T + message_delay • Improvements: • Average multiple measurements • Discard outlying measurements Client Time? Time=T Time server Processing Time CSS434 Time & Global States

  5. Clock SynchronizationActive Centralized Algorithm – Berkeley Algorithm • Assumption: processing time has been measured or estimated • Server: diff(i) = server_time – (ci_time + message_deley) • Client: ci_time = ci_time + diff(i) Time server Time? Diff(1) C1_time Client 1 Time? Diff(2) C2_time Client 2 CSS434 Time & Global States

  6. Clock SynchronizationDistributed Algorithm – Averaging Algorithm T0 +3R T0 +2R T0 +R T0 • Assumption: R is large enough to wait for all broadcast messages • All nodes broadcast their time periodically • Each node computes average. • Improvement: • Discard outlying time messages. • Exchange their time with their local neighbors. Node 1 N2_time=32 N1_time=31 N3_time=30 Node 2 N1_time=31 N3_time=30 N2_time=32 Node 3 CSS434 Time & Global States

  7. 1 2 2 3 3 3 Note: Arrows denote synchronization control, numbers denote strata. Clock SynchronizationNetwork Time Protocol UTC (Coordinated Universal Time) UDP message CSS434 Time & Global States

  8. Server B T T i -2 i-1 Time m m' Time Server A T T i - 3 i Clock SynchronizationNetwork Time Protocol o t’ t Ti = Ti-1 + t’ - o Ti-2 = Ti-3 + t + o di = t + t’ = Ti-2– Ti-3 + Ti– Ti-1 2o = Ti-2– Ti-3– t + Ti-1– Ti + t’ o = (Ti-2– Ti-3 + Ti-1– Ti)/2 + (t’– t)/2 CSS434 Time & Global States

  9. Event OrderingHappened-Before Relation Most applications need not maintain the real-time synchronized clock. • Eventeki: The kth event of process i • Sequencehki: The history of process I through to the event eki • Cause-and-effecte→e’: e proceeds e’. • Parallel eventse∥e’: e and e’ happen in parallel • Happens-Before Relation: • If eki, eli ∈hi and k < l, then eki → eli, • If ei = send(m) and ej = receive(m), then ei → ej, • If e → e’ and e’ → e”, then e → e” CSS434 Time & Global States

  10. e21 e11 P1 LC=2 LC=1 m1 e22 e12 P2 LC=4 LC=3 m1 e13 e23 P3 LC=5 LC=1 Event OrderingLogical Clock LC(ei) := (ei != receive(m)) ? LC + 1 : max(LC, TS(m)) + 1 where TS(m) is the timestamp of message m: • ee’ LC(e) < LC(e’) for all events • However, we cannot inferLC(e) < LC(e’)  ee’ Example: LC(e21) > LC(e13) but e21 || e13 CSS434 Time & Global States

  11. e21 e11 P1 (2,0,0) (1,0,0) m1 (2,2,0) (2,1,0) e22 e12 P2 m1 (0,0,1) (2,2,2) e13 e23 P3 Event OrderingVector Clock Vi[I] = vi[i] + 1; Pi includes the value t = Vi in every message it sends Vi[j] = max(vi[j], t[j]) for j = 1,2,…,N • ee’ V(e) < V(e’) • V(e) < V(e’)  ee’ Example:neither V(e21)  V(e13) nor V(e21)  V(e13), and thus e21 || e13 CSS434 Time & Global States

  12. Global StateApplications necessary to detect a correct global state This is not a garbage, because the in-transit message points to it Both p1 and p2 are passive and thus seems ready to finish, but an in-transit message makes p1 active again. CSS434 Time & Global States

  13. e11 e21 e21 p1 (send) e22 e12 e32 p2 p3 e23 e13 (receive) p4 e34 e14 e24 C C’ Global StateConsistent Cut Finding C such that (e ∈ C) ∧(e’ → e) ⇒ e’ ∈ C CSS434 Time & Global States

  14. Global StateDistributed Snapshot – Chandy/Lamport [1985] • A process that wants to take a snapshot sends a snapshot request to the others. • Each process records its state upon receiving the first snapshot request. • Each process keep recording the messages until receiving a snapshot request from each of the other process except the one that has originally initiated a snapshot. P0 P0 Snapshot request Message recording P1 s s s Ordinary message P2 P2 P1 s m s m m CSS434 Time & Global States

  15. Global StateDistributed Snapshot – Chandy/Lamport [1985] • Marker (Snapshot request) receiving rule for process pi • On pi’s receipt of a marker (snapshot request) 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 (Snapshot request) 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). CSS434 Time & Global States

  16. A Distributed Snapshot Example Start recording its state Consistent Cut Record itsstate Stop recording M Time line CSS434 Time & Global States

  17. Samadi’s Algorithm [1985] • Each process returns an ack whenever receiving a message. • Once receiving a snapshot message, each process returns a tag instead of an ack until a new GVT is compute. • When receiving a snapshot message, each process returns to P0 the minimum time among: • - the minimum timestamp among events that have not yet been processes. • - the minimum timestamp among messages that have not yet been acknowledged. • - the minimum timestamp among tags it has received. Take snapshot Report 12 Report 20 Report 15 p0 Done p1 12 16 p2 20 tag ack 20 p3 15 CSS434 Time & Global States

  18. 1st snapshot p1 (0,0,1,1) 2nd snapshot p2 (0,0,0,1) p3 (0,2,-1,0) (0,0,0,0) p4 (0,1,0,0) (0,0,1,0) (0,0,0,0) Mattern’s Algorithm [1993] • Process Pi maintains a vector counter: Vi[1..n]. • Pi writes in Vi[j] the number of messages sent to Pj. • Pi subtract one from Vi[j] when receiving a message from Pj • During the 1st circulation of a ‘take snapshot’ message, Pi performs: • C[1..n]+=Vi[1..n]; Vi[1..n] = 0 • Upon completing the 1st circulation, c[I] presents the number of messages in transit to Pi. • During the 2nd circulation, Pi wait for performs: • C[i] = 0 +1 -1 +1 -1 +1 -1 -1 +1 +1 -1 CSS434 Time & Global States

  19. An Example: Parallel and Distributed Simulation Process 0 Process 1 1cell/time unit 1cell/5 time units Process 2 Process 3 1cell/20 time units CSS434 Time & Global States

  20. An Example: Parallel and Distributed Simulation (Cont’d) Barrier per every simulation cycle Process 0 e2 e4 e3 e1 What drawbacks does this method have? attack Process 1 e5 e7 e6 e1 attack Process 2 e1 e9 e12 e8 e11 e10 Process 3 CSS434 Time & Global States

  21. An Example: Parallel and Distributed Simulation (Cont’d) Discrete event simulation with optimistic synchronization Old event history kept so as to rollback computation. Process 0 e2 e4 e3 e1 When can we garbage collect such history? attack Process 1 e5 e7 e6 e3 e1 e2 Rollback attack Process 2 e1 e9 e12 e8 e11 e10 Rollback Process 3 e14 e13 CSS434 Time & Global States

  22. Rollback 141 121 142 162 p1 LVT Arrived late Anti-message LVT p2 142 152 120 122 141 120 135 143 163 p3 LVT Time Warp[Jefferson 1985] • Optimistic Distributed Simulation • Each process has an input message, an output message, and an event history queue. • When a process receives a message whose timestamp is older than its local time: •   1.Roll back its local event execution to that old timestamp. •   2.Roll back its receipt of input messages whose timestamp is newer than that old timestamp. • 3.Send anti-messages to cancel all emanated messages whose timestamp is newer than that old timestamp. • GVT (Global Virtual Time): is periodically computed to garbage-collect all the executed events whose timestamp is older than GVT. CSS434 Time & Global States

  23. SPEEDS[Steinman 1992]Breathing Time Buckets • This is an optimistic distributed simulator, but so aggressive as Time Warp. • Each process broadcasts the oldest local even among those it will execute. This is called a Local Event Horizon (LEH). • A process must suspend its even processing if it has received an older LEH than the one it is currently processing. • The oldest LEH among all processes become the next Global Event Horizon (GEH). • Each process may send out all messages and process all events before this new GEH. • Processes which have already processed beyond GEH must roll back their computation to GEH. No anti-messages are sent out. P1’s LEH p1 p2 Next GEH (GVT) P2’s LEH CSS434 Time & Global States

  24. Vector timestamps and variable values for the execution Constraints |x1 – x2| <= 50. Before this is violated, a process must send its value to its partner. CSS434 Time & Global States

  25. The lattice of global states for the execution CSS434 Time & Global States

  26. F Evaluating possibly and definitelyf Possibility Must be True, and thud we don’t care Definitely = T for all linialization (4,3) = T and this is definitely All included: (2,2) = True CSS434 Time & Global States

  27. Paper Review by Students • Distributed Snapshot • Samadi’s Algorithm • Mattern’s Algorithm • Discussions: What are pros & cons of these algorithms? • Optimistic Synchronization • SPEEDS • Time Warp • Discussions: What are pros & cons of these algorithms in terms of performance, process creation/termination, dynamic memory allocation, and I/O handling? CSS434 Time & Global States

  28. Exercises (No turn-in) • Textbook p627, Q14.7: An NTP server B receives server A’s message at 16:34:23.480 bearing a timestamp 16:34:13.430 and replies to it. A receives the message at 16:34:15.725, bearing B’s timestamp 16:34:25.7. Estimate the offset between B and A and the accuracy of the estimate. • Textbook p628, Q14.14: Two processes P and Q are connected in a ring using two channels, and they constantly rotate a message m. At any one time, there is only one copy of m in the system. Each process’s state consists of the number of times its has received m, and P sends m first. At a certain point, P has the message and its state is 101. Immediately after sending m, P initiates the snapshot algorithm. Explain the operation of the algorithm in this case, given the possible global state(s) reported by it. • Textbook p429, Q14.15: The figure below shows events occurring for each of two processes, p1 and p2. Arrows between processes denote message transmission. Draw and label the lattice of consistent states (p1 state, p2 state), beginning with the initial state (0,0). p1 time p2 CSS434 Time & Global States