Chandy–Lamport algorithm: Difference between revisions

Revision as of 17:17, 14 February 2012

Latest revision as of 20:43, 5 February 2025

(38 intermediate revisions by 29 users not shown)

Line 1:

{{one source |date=May 2024}}

The '''snapshotChandy–Lamport algorithm''' is ana [[snapshot algorithm]] that is used in [[distributed systems]] for recording a consistent global state of an [[asynchronous communication|asynchronous]] system. TheIt algorithmwas discusseddeveloped hereby isand also known as '''Chandy-Lamport Algorithm''',named after [[Leslie Lamport]] and [[K. Mani Chandy]]. <ref>

Leslie Lamport, K. Mani Chandy: [https://research.microsoft.com/users/lamport/pubs/pubs.html#chandy ''Distributed Snapshots: Determining Global States of a Distributed System'']. In: ''ACM Transactions on Computer Systems 3''. Nr. 1, February 1985. ([http://lamport.azurewebsites.net/pubs/chandy.pdf PDF; 1&nbsp;MB])</ref>

==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>

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==

The assumptions of the algorithm are as follows:

* There are no failures and all messages arrive intact and only once

* The communication channels are unidirectional and [[FIFO (computing and electronics)|FIFO]] ordered

* There is a communication path between any two processes in the system

* Any process may initiate the snapshot algorithm

Line 19:

Some of the assumptions of the algorithm can be facilitated using a more reliable communication protocol such as [[Internet protocol suite|TCP/IP]]. The algorithm can be adapted so that there could be multiple snapshots occurring simultaneously.

==WorkingAlgorithm==

The snapshotChandy–Lamport algorithm works like this:

# The observer process (the process taking a snapshot):

## Saves its own local state

Line 27 ⟶ 28:

## Sends the observer process its own saved state

## Attaches the snapshot token to all subsequent messages (to help propagate the snapshot token)

# ShouldWhen a process that has already received the snapshot token receivereceives a message that does not bear the snapshot token, this process will forward that message to the observer process. This message was obviously sent before the snapshot “cut off” (as it does not bear a snapshot token and thus must have come from before the snapshot token was sent out) and needs to be included in the snapshot.

From this, the observer builds up a complete snapshot: a saved state for each process and all messages “in the ether” are saved.

==References==

{{Reflist}}

{{DEFAULTSORT:Chandy-Lamport algorithm}}

[http://www.lamport.org/ Leslie Lamport's Website]

[[Category:Distributed algorithms]]

[[de:Schnappschussalgorithmus]]

[[fa:الگوریتم اسنپ‌شات]]