Chandy–Lamport algorithm: Difference between revisions

Content deleted Content added
sp
History: minor fixes and improvements
Tags: Mobile edit Mobile web edit Advanced mobile edit
 
(15 intermediate revisions by 13 users not shown)
Line 4:
 
==History==
According to [http://research.microsoft.com/users/lamport/pubs/pubs.html#chandy Leslie Lamport's website], “The distributedthe snapshot algorithm was described here came about when Ihe visited Chandy, who was then at the [[University of Texas at Austin|University of Texas in (Austin)]]. HeChandy posed the problem to me over dinner, but wethey had both had too much wine to think about it right then. The next morning, while Lamport was in the shower, Ihe came up with the solution. When Ihe arrived at Chandy's office, he was waiting for mehim with the same solution. Lamport considers the algorithm to be a straightforward application of the basic ideas in his article ''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]]