CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

System Progress Estimation in Time based Coordinated Checkpointing Protocols

by P. K. Suri, Meenu Satiza
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 52 - Number 11
Year of Publication: 2012
Authors: P. K. Suri, Meenu Satiza
10.5120/8243-1752

P. K. Suri, Meenu Satiza . System Progress Estimation in Time based Coordinated Checkpointing Protocols. International Journal of Computer Applications. 52, 11 ( August 2012), 1-6. DOI=10.5120/8243-1752

@article{ 10.5120/8243-1752,
author = { P. K. Suri, Meenu Satiza },
title = { System Progress Estimation in Time based Coordinated Checkpointing Protocols },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 52 },
number = { 11 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume52/number11/8243-1752/ },
doi = { 10.5120/8243-1752 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:51:57.361138+05:30
%A P. K. Suri
%A Meenu Satiza
%T System Progress Estimation in Time based Coordinated Checkpointing Protocols
%J International Journal of Computer Applications
%@ 0975-8887
%V 52
%N 11
%P 1-6
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A mobile computing system consists of mobile and stationary nodes. Checkpointing is an efficient fault tolerant technique used in distributed systems. Checkpointing in mobile systems faces many new challenges such as low wireless bandwidth, frequent disconnections and lack of stable storage on mobile nodes. Coordinated Checkpointing that minimizes the number of processes to take useless checkpoints is a suitable approach to introduce fault tolerance in such systems. The time-based checkpointing protocol eliminates communication overheads by avoiding extra control messages and useless checkpoints. Such protocols directly accesses stable storage when checkpoints are saved. In this paper a new probabilistic approach for evaluation of the system progress is devised which is suitable for the mobile distribution applications. The system behavior is observed by varying some system parameters such as fault rate, clock drift rate, saved checkpoint time, checkpoint intervals. A validation regarding system progress is made via a simulation technique. The simulation results show that the proposed probabilistic model is well suited for the mobile computing systems.

References
  1. Chandy K. M. and Lamport L. "Distributed Snapshots: Determining Global States of Distributed Systems" ACM Transactions Computer systems vol. 3, no. 1. pp. 63-75, Feb. 1985
  2. Chaoguang M. , Yunlong Z. and Wenbin Y. , "A two-phase time-based consistent checkpointing strategy," in Proc. ITNG'06 3rd IEEE International Conference on Information Technology: New Generations, April 10-12, 2006, pp. 518–523.
  3. Chinara Suchistmita and Rath S. K. "An Energy Efficient Mobility Adaptive Distributed Clustering Algorithm for Mobile ad-hoc Network" 978-1-4244-2963-9/08 (2008) IEEE.
  4. Guohong Cao and Singhal Mukesh, "Mutable Checkpoints: a new checkpointing approach for Mobile Computing Systems", IEEE Transaction on Parallel and Distributed Systems, vol. 12, no. 2, pp. 157-172, February 2001
  5. Koo. R. and Toueg. S. "Checkpointing and Rollback-Recovery for Distributed Systems". IEEE Transactions on Software Engineering, SE-13(1): pp 23-31, January 1987.
  6. Kumar Lalit, Kumar Awasthi, "A Synchronous Checkpointing Protocol for Mobile Distributed Systems: Probabilistic Approach" International Journal of Information and Computer Security, Vol. 1, No. 3 . pp 298-314, 2007.
  7. Lin C. , Wang S. , and Kuo S. , "A Low Overhead Checkpointing Protocol for Mobile Computing System" in Proc of the 2002 IEEE Pacific Rim International Symposium on dependable computing (PRDC'02).
  8. Lin C. , Wang S. , and Kuo S. , "An efficient time-based checkpointing protocol for mobile computing systems over wide area networks," in Lecture Notes in Computer Science 2400, Euro-Par 2002, Springer-Verlag, 2002, pp. 978–982. Also in Mobile Networks and Applications, 2003, vo. 8, no. 6, pp. 687–697.
  9. Neves N. , Fuchs W. K. , "Using time to improve the performance of coordinated checkpointing," In: Proceedings of 2nd IEEE International Computer Performance and Dependability Symposium, Urbana-Champaign, USA, 1996, pp. 282 –291.
  10. Panghal Anil, Panghal Sharda, Rana Mukesh "Checkpointing Based Rollback Recovery in Distributed Systems" Journal of Current Computer Science and Technology Vol. 1 Issue 6
  11. 258-266.
  12. Prakash R. and Singhal M. , "Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems", IEEE Transaction on Parallel and Distributed Systems, vol. 7, no. 10, pp. 1035-1048, October1996.
  13. " System simulation with digital computer" by Narsingh Deo
Index Terms

Computer Science
Information Sciences

Keywords

Distributed system fault tolerance time-based checkpointing System progress consistent checkpoint