Content deleted Content added
No edit summary |
No edit summary |
||
Line 1:
The '''snapshot algorithm''' is an [[algorithm]] used in [[distributed systems]] for recording a consistent global state of an [[asynchronous communication|asynchronous]] system. It is also known as "Chandy-Lamport Algorithm for the determination of consistent global states."
==History==
According to one of the authors' [http://research.microsoft.com/users/lamport/pubs/pubs.html#chandy website], "The distributed snapshot algorithm described here came about when I visited Chandy, who was then at the 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 called "Distributed Snapshots: Determining Global States of a Distributed System"
==Definition==
| |||