Revision as of 22:03, 6 August 2016 edit Dingens5 (talk \| contribs) 79 edits m Dingens5 moved page Snapshot algorithm to Chandy-Lamport algorithm: describes the concrete algorithm, not the class of snapshot algorithms ← Previous edit		Revision as of 22:15, 6 August 2016 edit undo Dingens5 (talk \| contribs) 79 edits adapt introduction to page move Next edit →
Line 1: The '''~~snapshot~~Chandy–Lamport algorithm''' is ana [[snapshot algorithm]] that is used in [[distributed systems]] for recording a consistent global state of an [[asynchronous communication\|asynchronous]] system. ~~The~~It ~~algorithm~~was ~~discussed~~developed ~~here~~by isand ~~also known as the '''Chandy–Lamport algorithm''',~~named after [[Leslie Lamport]] and [[K. Mani Chandy]]. ==History== Line 20: ==Algorithm== The ~~snapshot~~Chandy-Lamport algorithm works like this: # The observer process (the process taking a snapshot): ## Saves its own local state

Chandy–Lamport algorithm: Difference between revisions