Top Qs
Timeline
Chat
Perspective
Snapshot algorithm
From Wikipedia, the free encyclopedia
Remove ads
A snapshot algorithm is used to create a consistent snapshot of the global state of a distributed system.[1] These algorithms are not practically possible, due to the lack of both a globally shared memory and a lack of a global clock.
 | 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)
|
Remove ads
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.
Remove ads
Algorithms
- Chandy–Lamport algorithm
- Lai–Yang algorithm
- Spezialetti–Kearns algorithm
- Mattern's algorithm
References
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads