Optimal Checkpoint Placement with Equality Constraints

Authors:
Tadashi Dohi;Tatsuya Ozaki;Naoto Kaio
Affiliations:
Hiroshima University, Japan;Hiroshima University, Japan;Hiroshima Shudo University, Japan
Venue:
DASC '06 Proceedings of the 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing
Year:
2006

Citing 0
Cited 3

Analysis of a software system with rejuvenation, restoration and checkpointing

ISAS'08 Proceedings of the 5th international conference on Service availability
Comprehensive evaluation of aperiodic checkpointing and rejuvenation schemes in operational software system

Journal of Systems and Software
Checkpoint scheduling model for optimality

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider aperiodic checkpoint placement problems with equality constraints over an infinite time horizon and develop both exact and approximate algorithms to determine the optimal checkpoint sequences minimizing the relevant expected costs. More precisely, the problem is to minimize the expected recovery cost (expected checkpointing cost) subject to a given level of the expected checkpointing cost (expected recovery cost). First, we develop exact computation algorithms to derive the optimal aperiodic checkpoint sequence by applying the Lagrange multiplier. Second, we propose approximate algorithms based on the variational calculus approach. Numerical examples are devoted to compare two computation algorithms in terms of both accuracy of the resulting checkpoint sequences and their computation efficiency.