第3讲 进程同步课程.ppt

Elections in Wireless Environments Figure 6-22. (e) The build-tree phase.  (f) Reporting of best node to source. A Summary Concept of synchronization Clock synchronization Logical clocks Mutual exclusion Centralized vs. distributed Token vs. permission Leader election Homework Questions * * * * * * * * * * * * * * * * * * * * §3.1 时钟同步 Clock Synchronization §3.2 逻辑时钟 Logical Clocks §3.3 互斥 Mutual Exclusion §3.4 选举 Leader Election Synchronizing Processes From communication to synchronization Time, order, etc. No global/universal information §3.1Clock Synchronization Figure 6-1. When each machine has its own clock, an event that occurred after another event may nevertheless be assigned an earlier time Clock Synchronization Algorithms Figure 6-5. The relation between clock time and UTC when clocks tick at different rates. Network Time Protocol (NTP) Figure 6-6. Getting the current time from a time server. The Berkeley Algorithm Figure 6-7. (a) The time daemon asks all the other machines for their clock values. Figure 6-7. (b) The machines answer. Figure 6-7. (c) The time daemon tells everyone how to adjust their clock. Clock Synchronization in Wireless Networks Figure 6-8. (a) The usual critical path in determining network delays. Figure 6-8. (b) The critical path in the case of RBS. Lamport’s Logical Clocks The happens-before relation → If a and b are events in the same process, and a occurs before b, then a → b is true. If a is the event of a message being sent by one process, and b is the event of the message being received by another process, then a → b Lamport’s Logical Clocks Figure 6-9. (a) Three processes with clocks at different rates. (b) Lamport’s algorithm corrects the clocks. Lamport’s Logical Clocks Updating counter Ci for process Pi Before executing an event Pi executes Ci ← Ci + 1. When process Pi sends a message m to Pj, it sets m’s timestamp ts (m) equal to Ci after having executed the p