Lecture Distributed Systems - Lecture 5: Logical Clocks. In this chapter, students will be able to understand: Why do we need global clocks? ordering of events, causally related versus concurrent, lamport’s logical clock, how lamport’s clocks advance, points to note, limitation of lamport’s clock, solution: vector clocks, partial order between timestamps, causal ordering, use of vector clocks in causal ordering of messages, birman-schiper-stephenson protocol, problem of vector clock, global state collection, notations, chandy-lamport’s algorithm, notable points, huang’s algorithm, weight distribution and recovery. |
