Issue No. 02 - February (2001 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.910871
<p><b>Abstract</b>—Mobile computing raises many new issues such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. Coordinated checkpointing is an attractive approach for transparently adding fault tolerance to distributed applications since it avoids domino effects and minimizes the stable storage requirement. However, it suffers from high overhead associated with the checkpointing process in mobile computing systems. Two approaches have been used to reduce the overhead: First is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process nonblocking. These two approaches were orthogonal previously until the Prakash-Singhal algorithm [<ref rid="bibl015728" type="bib">28</ref>] combined them. However, we [<ref rid="bibl01578" type="bib">8</ref>] found that this algorithm may result in an inconsistency in some situations and we proved that there does not exist a nonblocking algorithm which forces only a minimum number of processes to take their checkpoints. In this paper, we introduce the concept of “mutable checkpoint,” which is neither a tentative checkpoint nor a permanent checkpoint, to design efficient checkpointing algorithms for mobile computing systems. Mutable checkpoints can be saved anywhere, e.g., the main memory or local disk of <it>MH</it>s. In this way, taking a mutable checkpoint avoids the overhead of transferring large amounts of data to the stable storage at <it>MSS</it>s over the wireless network. We present techniques to minimize the number of mutable checkpoints. Simulation results show that the overhead of taking mutable checkpoints is negligible. Based on mutable checkpoints, our nonblocking algorithm avoids the avalanche effect and forces only a minimum number of processes to take their checkpoints on the stable storage.</p>
Mobile computing, coordinated checkpointing, causal dependency, nonblocking.
M. Singhal and G. Cao, "Mutable Checkpoints: A New Checkpointing Approach for Mobile Computing Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 12, no. , pp. 157-172, 2001.