Analysis of Recent Checkpointing Techniques for Mobile Computing Systems
Ruchi Tuli, Parveen Kumar

TL;DR
This paper surveys various checkpointing algorithms used in mobile computing systems to improve reliability and recovery from transient failures in distributed environments.
Contribution
It provides a comprehensive review of existing checkpointing techniques specifically tailored for mobile computing systems.
Findings
Identifies key algorithms used for checkpointing in mobile systems.
Highlights challenges and solutions for fault tolerance in mobile environments.
Summarizes the effectiveness of different checkpointing strategies.
Abstract
Recovery from transient failures is one of the prime issues in the context of distributed systems. These systems demand to have transparent yet efficient techniques to achieve the same. Checkpoint is defined as a designated place in a program where normal processing of a system is interrupted to preserve the status information. Checkpointing is a process of saving status information. Mobile computing systems often suffer from high failure rates that are transient and independent in nature. To add reliability and high availability to such distributed systems, checkpoint based rollback recovery is one of the widely used techniques for applications such as scientific computing, database, telecommunication applications and mission critical applications. This paper surveys the algorithms which have been reported in the literature for checkpointing in Mobile Computing Systems.
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 systems and fault tolerance · Age of Information Optimization · Optimization and Search Problems
