Chandy–Lamport algorithm: Difference between revisions

Content deleted Content added
History: minor fixes and improvements
Tags: Mobile edit Mobile web edit Advanced mobile edit
 
(13 intermediate revisions by 11 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)|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 theyLamport werewas in the shower, theyhe came up with the solution. When theyhe arrived at Chandy's office, he was waiting for herhim 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 35:
{{Reflist}}
 
{{DEFAULTSORT:Chandy-Lamport algorithm}}
[[Category:Distributed algorithms]]