A snapshot algorithm is used to create a consistent snapshot of the global state of a distributed system.^[1] Due to the lack of globally shared memory and a global clock, this is not trivially possible.

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages) This article's tone or style may not reflect the encyclopedic tone used on Wikipedia. (November 2016) This article needs additional citations for verification. (August 2016)

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.

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