Analysis of Distributed Snapshot Algorithms
Sharath Srivatsa

TL;DR
This paper investigates how snapshot recording durations at processes affect the efficiency of distributed snapshot algorithms, providing insights into their reliability and effectiveness through simulation results.
Contribution
It presents an analysis of snapshot recording duration variations and identifies key characteristics for reliable and effective distributed snapshot algorithms.
Findings
Variations in recording durations impact algorithm efficiency
Key characteristics for reliable snapshot algorithms are identified
SimGrid Java API was used for simulation studies
Abstract
Snapshot recording durations at each process contribute to the overall efficiency of the algorithm. In this paper we are presenting the observed variations in snapshot recording durations at processes in a distributed system. We conclude with key characteristics of a reliable and effective snapshot algorithm. Simulations were achieved using SimGrid Java API.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Distributed systems and fault tolerance · Parallel Computing and Optimization Techniques
