ppt课件-15-440 distributed systems（15 - 440分布式系统）.pptVIP

* animates the points relaibility, primary and secondary servers * Local times of Send and Receive of previous message Local times of Send of current message Recipient notes the time of receipt ( we have Ti-3, Ti-2, Ti-1, Ti) In symmetric mode there can be a non-negligible delay between messages * * Animation explains the following: In Figure 10.5 a - b (at p1) c-d at p2 and b-c because of m1 also d- f because of m2. Not all events are related by - (happened before) consider a and e. (different processes and no chain of messages to relate them) Happened before relation - relation of causal ordering HB1, HB2 and HB3 (page 397) are formal statements of the three points on the slide * Animation explains the following: In Figure 10.5 a - b (at p1) c-d at p2 and b-c because of m1 also d- f because of m2. Not all events are related by - (happened before) consider a and e. (different processes and no chain of messages to relate them) Happened before relation - relation of causal ordering HB1, HB2 and HB3 (page 397) are formal statements of the three points on the slide * Discuss LC1 and LC2 for Figure 10.6 (same as 10.5). Initially clocks all set to 0. (a - 1) b-2 etc. For m1, 2 is piggybacked and c gets max(1,2) + 1. Same for m2. Note e - e’ implies L(e) L(e’). Converse not true. E.g. events b and e. (b || e) concurrent. * Following points animated : Vector clocks overcome the shortcoming of Lamport logical clocks (L(e) L(e’) does not imply e happened before e’) e.g. events e and c Vector timestamps are used to timestamp local events. Applied in schemes for replication of data e.g. Gossip (p 572), Coda (p585) and causal multicast The rules VC1-VC4 are for updating vector clocks Work through figure 10.7. At p1 a(1,0,0) b (2,0,0) send (2,0,0) on m1 At p2 on receipt of m1 get max((0,0,0), (2,0,0) = (2,0,0) add 1 - (2,1,0). Meaning of =, =, max etc for vector timestamps. Note that e- e’ implies V(e) V(e’). The converse is also true. But c || e parallel) because n