Abstract
Mobile computing is going to change the way, computers are used today. However mobile computing environment has features like high mobility, frequent disconnections, and lack of resources, such as memory and battery power. Such features make applications, running on mobile devices, more susceptible to faults. Checkpointing is a major technique to confine faults and restart applications faster. In this paper, we present a coordinated checkpointing algorithm for deterministic applications. We are using anti-messages along-with selective logging to achieve faster recovery and reduced energy consumption. Our algorithm is non-blocking in nature and avoids unnecessary computation. We ask only minimum number of processes to take the checkpoint and also take in to account the limited storage available at mobile devices.
Chapter PDF
Similar content being viewed by others
References
Elnozahy, E., Johnson, D., Wang, Y.: A survey of rollback-recovery protocols in message-passing systems. Technical Report CMU-CS-96-181 (1996)
Cao, G., Singhal, M.: Mutable checkpoints: A new checkpointing approach for mobile computing systems. IEEE Transactions on Parallel and Distributed Systems 12 (2001)
Manivannan, D., Singhal, M.: Failure recovery based on quasi-synchronous checkpointing in mobile computing systems. Technical Report OSU-CISRC-796-TR36, Dept. of Computer and Information Science, The Ohio State University (1996)
Myers, D.R.J.A.: Virtual time. ACM Transactions on Programming Language and Systems 7, 404–425 (1985)
Prakash, R., Singhal, M.: Low-cost checkpointing and failure recovery in mobile computing systems. IEEE Transactions on Parallel and Distributed Systems 7, 1035–1048 (1996)
Johnson, D.B., Zawenepoel, W.: Sender-based message logging. In: Proceedings of 17th International Symposium on Fault-Tolerant Computing, pp. 14–19 (1987)
Johnson, D.B., Zwaenepoel, W.: Recovery in distributed systems using optimistic message logging and checkpointing, pp. 171–181 (1988)
Manabe, Y.: A distributed consistent global checkpoint algorithm for distributed mobile systems. In: 8th International Conference on Parallel and Distributed Systems, pp. 125–132 (2001)
Cao, G., Singhal, M.: Low-cost checkpointing with mutable checkpoints in mobilecomputing systems. In: Proceedings of 18th International Conference on Distributed Computing Systems, pp. 462–471 (1998)
Singh, P., Cabillic, G.: Fault tolerance and availability in mobile computing environment (2003) (selected to appear in PDPTA)
Manabe, Y.: A distributed first and last consistent global checkpoint algorithm. In: 12th International Conference on Information Networking (1998)
Singh, P., Cabillic, G.: Successive checkpointing approach for mobile computing environment (2003) (selected to appear in ICWN)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Singh, P., Cabillic, G. (2003). A Checkpointing Algorithm for Mobile Computing Environment. In: Conti, M., Giordano, S., Gregori, E., Olariu, S. (eds) Personal Wireless Communications. PWC 2003. Lecture Notes in Computer Science, vol 2775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39867-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-39867-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20123-6
Online ISBN: 978-3-540-39867-7
eBook Packages: Springer Book Archive