On distributed snapshots. (English) Zbl 0653.68008

Summary: We develop an efficient snapshot algorithm that needs no control messages and does not require channels to be first-in-first-out. We also show that several stable properties (e.g., termination, deadlock) can be detected with uncoordinated distributed snapshots. For such properties, our algorithm can be further simplified.


68N25 Theory of operating systems
Full Text: DOI


[1] Chandy, K.M.; Lamport, L., Distributed snapshots: determining global states of distributed systems, ACM trans. comput. syst., 3, 1, 63-75, (1985)
[2] Chandy, K.M.; Misra, J.; Haas, L.M., Distributed deadlock detection, ACM trans. comput. syst., 1, 2, 144-156, (1983)
[3] Dijkstra, E.W., Self-stabilizing systems in spite of distributed control, Comm. ACM, 17, 643-644, (1974) · Zbl 0305.68048
[4] Dijkstra, E.W., The distributed snapshot of K.M. chandy and L. lamport, ()
[5] Dijkstra, E.W., A belated proof of self-stabilization, Distributed comput., 1, 5-6, (1986) · Zbl 0604.68015
[6] Francez, N.; Rodeh, M., Achieving distributed termination without freezing, IEEE trans. software engrg., SE-8, 287-292, (1982) · Zbl 0478.68024
[7] Lai, T.H., Termination detection for dynamically distributed systems with non-first-in-first-out communication, J. parallel & distributed computing, 3, 577-599, (1986)
[8] Morgan, C., Global and logical time in distributed algorithms, Inform. process. lett., 20, 189-194, (1985)
[9] Spezialetti, M.; Kearns, P., Efficient distributed snapshots, (), 382-388
[10] Topor, R., Termination detection for distributed computations, Inform. process. lett., 18, 33-36, (1984)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.