This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (assume there are n processes in the system and Vt i denotes the vector timestamp of the snapshot taken process p i ): (Vt 1 , Vt 2 , . ..., Vt n [n]) = max(Vt 1 , Vt 2 , . ..., Vt n ). Don't worry about the channel states. 4) Consider a distributed system where every node has its physical clock and all physical clocks are perfectly synchronized. Give an algorithm to record global state assuming the communication network is reliable. (Note that your algorithm should be simpler than the Chandy-Lamport algorithm). 5) What modifications should be done to the Chandy-Lamport snapshot algorithm so that it records a strongly consistent snapshot (I.e., all channel states are recorded empty)....
View Full Document
This note was uploaded on 12/27/2011 for the course CMPSC 171 taught by Professor Agrawal during the Fall '09 term at UCSB.
- Fall '09