Chandy–Lamport algorithm: Difference between revisions

Revision as of 17:43, 20 September 2024

Revision as of 22:07, 14 October 2024

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 they visited Chandy, who was at the [[University of Texas (Austin)|University of Texas (Austin)]]. He posed the problem over dinner, but they 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. They considered the algorithm to be the straightfoward application from the basic ideas of 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]]