Misplaced Pages

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article's tone or style may not reflect the encyclopedic tone used on Misplaced Pages. See Misplaced Pages's guide to writing better articles for suggestions. (November 2016) (Learn how and when to remove this message) This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Snapshot algorithm" – news · newspapers · books · scholar · JSTOR (August 2016) (Learn how and when to remove this message) (Learn how and when to remove this message)

A snapshot algorithm is used to create a consistent snapshot of the global state of a distributed system. These algorithims are not practically possible, due to the lack of both a globally shared memory and a lack of a global clock.

Example

Several computers work together in a distributed system. Each of them represents a bank account holding a certain amount of money. The participants can transfer money between their accounts by exchanging the messages.

To calculate the overall balance, just requesting the balance of each participant can lead to an incorrect result, as different accounts might be recorded before or after any transfers in progress. But a snapshot algorithm would avoid this as it makes sure to record the whole state in a point in time.

Algorithms

• Chandy–Lamport algorithm
• Lai–Yang algorithm
• Spezialetti–Kearns algorithm
• Mattern's algorithm

References

1. Vijay K. Garg (23 May 2002). Elements of Distributed Computing. John Wiley & Sons. p. 121. ISBN 978-0-471-03600-5.

This computer science article is a stub. You can help Misplaced Pages by expanding it.

• v
• t
• e

• Distributed algorithms
• Computer science stubs