Snapshot algorithm
 | 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) |
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 isn't trivially possible.
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.
Assume the overall balance shall be calculated. Just requesting the balance of each participant can lead to an incorrect result, if one of them just sent a transfer message to another one (and thus has already decreased its own balance), which did not yet receive it.
A snapshot algorithm avoids such inconsistencies.
Algorithms
References
- ^ Vijay K. Garg (23 May 2002). Elements of Distributed Computing. John Wiley & Sons. pp. 121–. ISBN 978-0-471-03600-5.