Mutable Checkpoints: A New Checkpointing Approach for Mobile Computing Systems
IEEE Transactions on Parallel and Distributed Systems
Process Recovery in Heterogeneous Systems
IEEE Transactions on Computers
An Efficient Optimistic Message Logging Scheme for Recoverable Mobile Computing Systems
IEEE Transactions on Mobile Computing
An Adaptive Checkpointing Protocol to Bound Recovery Time with Message Logging
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Design and analysis of a fault tolerant hybrid mobile scheme
Information Sciences: an International Journal
Mobile agent based fault-tolerance support for the reliable mobile computing systems
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
| Hi-index | 0.00 |
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. In this paper, we introduce the concept of ``mutable checkpoint'', which is neither a tentative checkpoint nor a permanent checkpoint. Mutable checkpoints can be saved any where; e.g., the memory or local disk of $MH$s. In this way, taking a mutable checkpoint avoids the overhead of transferring large amount of data to the stable storage in $MSS$ over the wireless network. Based on mutable checkpoints, our non-blocking algorithm avoids avalanche effect, minimizes the number of synchronization messages, and forces only a minimum number of processes to take their checkpoints on the stable storage.