On the Optimum Checkpoint Interval

  title={On the Optimum Checkpoint Interval},
  author={E. Gelenbe},
  journal={J. ACM},
One of the basic problems related to the efficient and secure operation of a transaction oriented file or database system is the choice of the checkpoint interval In this paper we show that the optimum checkpoint interval (i e the time interval between successive checkpoints which maximizes system avadabihty) is a function of the load of the system We also prove that the total operating time of the system (and not the total real time) between successive checkpoints should be a deterministic… Expand
An algorithm for non-interfering checkpoints and its practicality in distributed database systems
  • S. Son
  • Computer Science
  • Inf. Syst.
  • 1989
The practicality of a non-interfering checkpointing algorithm is studied by analyzing the extra workload of the system. Expand
Analysis of a Transaction System with Checkpointing, Failures, and Rollback
The problem of determining the optimal checkpointing parameter is considered and the joint steady-state distribution of the process, and hence the performance measures of interest, is found by two different methods: generating functions and spectral expansion. Expand
On the Optimal Checkpointing of Critical Tasks and Transaction-Oriented Systems
The probability distribution of the overhead caused by the use of the checkpointing rollback recovery technique is evaluated and strategies based on this distribution are proposed in Laplace-Stieltjes transform form, from which all the moments can be easily calculated. Expand
Availability and performance evaluation of database systems under periodic checkpoints
This work finds expressions for the system availability and for the expected response time of the transactions from a model that, unlike previous analytical work, takes into account the dependency among the recovery times between two checkpoints. Expand
Reliability mechanisms for ADAMS
A non-interfering checkpointing mechanism being developed for ADAMS that has global consistency and reduced interference, both of which are crucial for achieving high availability. Expand
Selection of a checkpoint interval in a critical-task environment
The selection of an optimal checkpointing strategy has most often been considered in the transaction processing environment where systems are allowed unlimited repairs. In this environment an optimalExpand
Distributed Checkpointing for Globally Consistent States of Databases
A new algorithm for checkpointing in distributed database systems is proposed and its correctness is proved, and the practicality of the algorithm is discussed by analyzing the extra workload and the robustness of it with respect to site fallures. Expand
Optimum Interval for Application-level Checkpoints
  • Miltiadis G. Siavvas, E. Gelenbe
  • Computer Science
  • 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)
  • 2019
A mathematical model is developed to estimate the optimum checkpoint interval, i.e., the interval between two successive checkpoints that minimises the average execution time of the application. Expand
Effects of Checkpointing and Queueing on Program Performance
Checkpointing is a well-known procedure to reduce the execution time of programs in the presence of failures. If a failure occurs, the work done on the program since the last checkpoint is lost andExpand
Optimal checkpointing procedures taking into account system failure caused by checkpointing
This paper considers the event where a failure due to the checkpointing is produced at the time of checkpointing and proposes a procedure to derive the optimal checkpoints sequence as the optimal checkpointing strategy. Expand


Analytic models for rollback and recovery strategies in data base systems
These models and techniques are presented which aid in determining optimal times for checkpoints and all transactions on the audit trail since this check point are reprocessed in chronological sequence, thus recovering from the error. Expand
A model of roll-back recovery with multiple checkpoints
A stochastic model of a transaction oriented computer system in the presence of intermittent failures, operating with a checkpoint and roll-back recovery scheme, is proposed in the case of aExpand
A first order approximation to the optimum checkpoint interval
It is standard practice to save periodically sufficient information to enable the job to be restarted at the previous point at which information was saved, and the saving of such information at these points is called checkpointing. Expand
The stability of queues with non-independent interarrival and service times
From Lemma 1 it follows that none of these queues can be properly substable if all the servers are initially unoccupied. Expand
A Survey of Analytic Models of Rollback and Recovery Stratergies
There are several ways to increase system reliability. Choosing the most cost-effective one is not easy, but models such as those outlined in this paper can help.
Some Conditions for Ergodicity and Recurrence of Markov Chains
  • A. Pakes
  • Mathematics, Computer Science
  • Oper. Res.
  • 1969
Find sufficient conditions for the ergodicity and recurrence of irreducible and aperiodic Markov chains and their use in discussing a certain class of queuing problem with state dependent service times is indicated. Expand
Journal or the Assocmtmn for Computing Mac/unery
  • Journal or the Assocmtmn for Computing Mac/unery
  • 1979
13 Roam, M Quelques probl6mes de contr61e stochasUque Th, U Pans-Dauphine
  • 13 Roam, M Quelques probl6mes de contr61e stochasUque Th, U Pans-Dauphine
  • 1978
A survey of analyuc models of roll-back and recovery strategies Computer 8, 5 (May 1975)
  • 1975
AnalyUc models for rollback and recovery strategms m data base systems
  • IEEE Trans Software Eng. SE-1,
  • 1975