Abstract
Two checkpointing approaches i.e., coordinated checkpointing and times based checkpointing are widely used in the literature of MDSs. Coordinated checkpointing protocols uses the less checkpoints and domino free but have large coordinated message overheads as processes synchronize by exchanging coordinated message. Time based approach has minimum coordinated messages overheads cost but has high checkpointing cost as it requires large number checkpoints than minimum. Hence coordinated checkpointing approach have minimum checkpointing cost than time based approach but higher coordinated message overheads cost which increases the checkpointing overheads. In this paper, we design an efficient time coordinated checkpointing algorithm which uses time to indirectly coordinate to minimize the number of coordinated message transmitted through the wireless link and reduces the number of checkpoints nearest to the minimum. The algorithm is non-blocking and minimum process.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Acharya A, Badrinath BR (1994) Checkpointing distributed application on mobile computers. In: Proceedings of the 3rd international conference on parallel and distributed, information systems, pp 73–80, Sept 1994
Ahn J, Min S, Hwang C (2004) A casual message logging protocol for mobile nodes in mobile computing systems. Futur Gener Comput Syst 20(4):663–686
Candy KM, Lamport L (1985) Distributed snapshots: determining global state of distributed systems. ACM Trans Comput Syst 3(1):63–75
Cao G, Singhal M (2001) Mutable checkpoints: a new checkpointing approach for mobile computing systems. IEEE Trans Parallel Distrib Syst 12(2):157–172
Forman GH, Zahorjan J (1994) The challenges of mobile computing. IEEE Trans Comput 27(4):38–47
Koo R, Toueg S (1987) Checkpointing and roll-back recovery for distributed systems. IEEE Trans Softw Eng 13(1):23–31
Neogy S, Sinha A, Das P (2002) Distributed checkpointing using synchronized clocks. In: Proceedings of the 26th IEEE annual international conference on computer software and applications (OMPSAC’02), pp 199–206
Neves N, Fuchs WK (1997) Adaptive recovery for mobile environments. ACM Commun 40(1):68–74
Singh AK (2007) On mobile checkpointing using index and time together. World Acad Sci Eng Technol 32:144–151
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this paper
Cite this paper
Surender, J., Arvind, S., Anil, K., Yashwant, S. (2013). Low Overhead Time Coordinated Checkpointing Algorithm for Mobile Distributed Systems. In: Chaki, N., Meghanathan, N., Nagamalai, D. (eds) Computer Networks & Communications (NetCom). Lecture Notes in Electrical Engineering, vol 131. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6154-8_17
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6154-8_17
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-6153-1
Online ISBN: 978-1-4614-6154-8
eBook Packages: EngineeringEngineering (R0)