PPT Slide

Lamport’s Algorithm

• For any two events a and b in a process Pi, if a occurs before

b, then Ci(a) < Ci(b) or Ci(b) = Ci(a) + d where d > 0

• If a is a message send event on Pi and b is the message receive

event on Pj, then

the message is assigned the timestamp tm= Ci(a)

Cj(b) = max(Cj, tm+ d)

• Limitation of Lamport’s algorithm

how to distinguish the clock change due to local events

and message exchange betw. processes

Previous slide

Next slide

Back to first slide

View graphic version