Min-Max Checkpoint Placement under Incomplete Failure Information

Authors:
Tatsuya Ozaki;Tadashi Dohi;Hiroyuki Okamura;Naoto Kaio
Affiliations:
Hiroshima University;Hiroshima University;Hiroshima University;Hiroshima Shudo University
Venue:
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Year:
2004

Citing 0
Cited 2

Distribution-Free Checkpoint Placement Algorithms Based on Min-Max Principle

IEEE Transactions on Dependable and Secure Computing
Fault detection and recovery efficiency co-optimization through compile-time analysis and runtime adaptation

Proceedings of the 2013 International Conference on Compilers, Architectures and Synthesis for Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider two kinds of sequential checkpointplacement problems with infinite/finite time horizon.For these problems, we apply the approximation methodsbased on the variational principle and develop the computationalgorithms to derive the optimal checkpoint sequenceapproximately. Next, we focus on the situation where theknowledge on system failure is incomplete, i.e. the systemfailure time distribution is unknown. We develop theso-called min-max checkpoint placement methods to determinethe optimal checkpoint sequence under the uncertaincircumstance in terms of the system failure time distribution.In numerical examples, we investigate quantitativelythe min-max checkpoint placement methods, and refer totheir potential applicability in practice.