

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
An in-depth explanation of the distributed snapshot algorithm, a method used to construct consistent global states in distributed systems without freezing participating processes. The algorithm, proposed by chandy and lamport in 1985, assumes fifo delivery through strongly connected unidirectional point-to-point communication channels. The organization of processes and channels, the algorithm steps, and the role of any process in initiating the snapshot.
Typology: Study notes
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Section 5.3 Tanenbaum (informal description) Section 4.13 Mullender (formal description - recommended reading)
a) Organization of a process and channels for a distributed snapshot