Optimal Checkpoint Placement with Equality Constraints

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing : (DASC 2006) : proceedings : September 29-October 1, 2006, Indiana University-Purdue University, Indianapolis, USA s. 77 - 84
Hlavní autori: Dohi, T., Ozaki, T., Kaio, N.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.09.2006
Predmet:
Checkpointing
Cost function
Distributed computing
Dynamic programming
Environmental economics
File systems
Heuristic algorithms
Memory management
Preventive maintenance
Processor scheduling
ISBN:9780769525396, 0769525393
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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
ISBN:9780769525396
0769525393
DOI:10.1109/DASC.2006.37