On the memory overhead of distributed snapshots

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199908)34:1<11::AID-NET2>3.0.CO;2-X" /><11::AID-NET2>3.0.CO;2-X 10.1002/(SICI)1097-0037(199908)34:1<11::AID-NET2>3.0.CO;2-XzbMath0959.90011OpenAlexW2014362520MaRDI QIDQ4262691

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<11::aid-net2>3.0.co;2-x

zbMATH Keywords

memory overheaddistributed snapshots

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

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

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