Lazy Snapshorts

Nigamanth SridharN. Sridhar and P.A.G. Sivilotti (USA)


parallel/distributed algorithms, snap shots, termination detection.


Determining the global state of distributed systems is an important problem in the absence of global memory and global clocks. Several algorithms have been proposed for collecting global states. This paper presents an optimization to the algorithm proposed by Chandy and Lamport that lets processes in a distributed system take a lazy approach to recording their state. The lazy optimization relaxes the constraint on when a process must record its local state and send out markers. Our algorithm yields the flexibility of postponing a local snapshot and hence reducing the amount of space required to save channel state.

Important Links:

Go Back