Chandy–Lamport algorithm: Difference between revisions

Revision as of 12:51, 9 November 2016

Revision as of 09:56, 2 October 2017

Line 1:

The '''Chandy–Lamport algorithm''' is a [[snapshot algorithm]] that is used in [[distributed systems]] for recording a consistent global state of an [[asynchronous communication|asynchronous]] system. It was developed by and named after [[Leslie Lamport]] and [[K. Mani Chandy]].<ref>http://research.microsoft.com/users/lamport/pubs/chandy.pdf Distributed Snapshots: Determining Global States of a Distributed System</ref>

==History==

According to [http://research.microsoft.com/users/lamport/pubs/pubs.html#chandy Leslie Lamport's website], “The distributed snapshot algorithm described here came about when I visited Chandy, who was then at the [[University of Texas at Austin|University of Texas in Austin]]. He posed the problem to me over dinner, but we had both had too much wine to think about it right then. The next morning, in the shower, I came up with the solution. When I arrived at Chandy's office, he was waiting for me with the same solution.”

It was defined in a paper titled “[http://research.microsoft.com/users/lamport/pubs/chandy.pdf Distributed Snapshots: Determining Global States of a Distributed System].”

==Definition==

Line 32 ⟶ 30:

[[Category:Distributed algorithms]]

==References==

{{Reflist}}