On distributed snapshots
From MaRDI portal
Publication:1107971
DOI10.1016/0020-0190(87)90125-6zbMATH Open0653.68008OpenAlexW2130004097MaRDI QIDQ1107971FDOQ1107971
Authors: Tao H. Yang, Ten H. 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
Recommendations
Cites Work
Cited In (16)
- Building hot snapshot copy based on windows file system
- Flush primitives for asynchronous distributed systems
- Strong stable properties in distributed systems
- Communication-based prevention of useless checkpoints in distributed computations
- Distributed snapshots for ad hoc network systems
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- The inhibition spectrum and the achievement of causal consistency
- Checkpointing with mutable checkpoints.
- A family of optimal termination detection algorithms
- An optimal algorithm for distributed snapshots with causal message ordering
- Calculs approchés de la borne inférieure de valeurs réparties
- An efficient snapshot collection protocol for deterministic mobile distributed systems
- Prime numbers as a tool to design distributed algorithms
- Recording distributed snapshots based on causal order of message delivery
- Tools and Algorithms for the Construction and Analysis of Systems
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
This page was built for publication: On distributed snapshots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107971)