On distributed snapshots

DOI10.1016/0020-0190(87)90125-6zbMath0653.68008OpenAlexW2130004097MaRDI QIDQ1107971

Tao H. Yang, Ten-Hwang Lai

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90125-6

zbMATH Keywords

distributed systemterminationdeadlockstable propertiessnapshot algorithm

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (11)

An optimal algorithm for distributed snapshots with causal message ordering ⋮ Flush primitives for asynchronous distributed systems ⋮ A family of optimal termination detection algorithms ⋮ Strong stable properties in distributed systems ⋮ The inhibition spectrum and the achievement of causal consistency ⋮ Communication-based prevention of useless checkpoints in distributed computations ⋮ Distributed snapshots foradhocnetwork systems ⋮ Calculs approchés de la borne inférieure de valeurs réparties ⋮ Recording distributed snapshots based on causal order of message delivery ⋮ Prime numbers as a tool to design distributed algorithms ⋮ Checkpointing with mutable checkpoints.

Cites Work

• A belated proof of self-stabilization
• Achieving Distributed Termination without Freezing
• Self-stabilizing systems in spite of distributed control

This page was built for publication: On distributed snapshots