Chandy–Lamport algorithm: Difference between revisions

Revision as of 08:00, 7 January 2025

Latest revision as of 20:43, 5 February 2025

(7 intermediate revisions by 7 users not shown)

Line 4:

==History==

According to [http://research.microsoft.com/users/lamport/pubs/pubs.html#chandy Leslie Lamport's website], the snapshot algorithm was described when theyhe visited Chandy, who was at the [[University of Texas (Austin)]]. HeChandy posed the problem over dinner, but they had had too much wine to think about it. The next morning, while Lamport was in the shower, he came up with the solution. When he arrived at Chandy's office, he was waiting for him with the same solution. TheyLamport consideredconsiders the algorithm to be thea straightfowardstraightforward application fromof the basic ideas ofin his article 27, titled "'''Time, Clocks and the Ordering of Events in a Distributed System".'''. <ref>{{Cite web |title=The Writings of Leslie Lamport |url=https://lamport.azurewebsites.net/pubs/pubs.html?from=https://research.microsoft.com/users/lamport/pubs/pubs.html&type=path#time-clocks |access-date=2024-08-24 |website=lamport.azurewebsites.net}}</ref>

==Definition==

Line 18:

Some of the assumptions of the algorithm can be facilitated using a more reliable communication protocol such as [[Internet protocol suite|TCP/IP]]. The algorithm can be adapted so that there could be multiple snapshots occurring simultaneously.

//I hope this helps

==Algorithm==

Line 33 ⟶ 31:

From this, the observer builds up a complete snapshot: a saved state for each process and all messages “in the ether” are saved.

//...Thank you

==References==