Synchronization Algorithm of node i

1
Synchronization Algorithm of node i

• int clocksn
• message m
• while(true)
• send clocksi to all neighbors
• int size mailbox.size()
• for (int u 0 u lt size u)
• m mailboxu from neighbor j
• If (m is a clock value message)
• clocksj m.clocks
• else
• handle message m
• if (Pi is not synchronized)
• clocksi max(clocks)
• else
• clocksi unless this operation makes Pi
  unsynchronized
• sleep(1)