On the memory overhead of distributed snapshots

DOI10.1002/(SICI)1097-0037(199908)34:1%3C11::AID-NET2%3E3.0.CO;2-XMaRDI QIDQ4262691zbMATH OpenOpenAlexFDO

Authors Lior Shabtay, Adrian Segall

Publication date 22 September 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199908)34:1%3C11::aid-net2%3E3.0.co;2-x

zbMATH Keywords

distributed snapshotsmemory overhead

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• On distributed snapshots
• Dynamic atomic snapshots
• SOFSEM 2005: Theory and Practice of Computer Science
• Time-space tradeoffs for implementations of snapshots
• Time-Lapse Snapshots

Cites work

• An example of stepwise refinement of distributed programs: quiescence detection
• An Optimal Synchronizer for the Hypercube
• Complexity of network synchronization
• Distributed network protocols
• Termination detection for diffusing computations

Cited in

(2)

• On distributed snapshots
• Time-space tradeoffs for implementations of snapshots

This page was built for publication: On the memory overhead of distributed snapshots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4262691)