Revision as of 09:56, 2 October 2017 edit Wilfrid (talk \| contribs) 8 edits Move reference to the paper to "References" ← Previous edit		Revision as of 11:37, 2 October 2017 edit undo Dingens5 (talk \| contribs) 79 edits complete ref Next edit →
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> 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, Februar 1985. ([http://research.microsoft.com/users/lamport/pubs/chandy.pdf PDF; 1 MB])</ref> ==History==

Chandy–Lamport algorithm: Difference between revisions