The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1988 vol.37)
pp: 491-496
ABSTRACT
A numerical approach for computing optimal dynamic checkpointing strategies for general rollback and recovery systems is presented. The system is modeled as a Markov renewal decision process. General failure distributions, random checkpointing durations, and reprocessing-dependent recovery times are allowed. The aim is to find a dynamic decision rule to maximize the average system availability
INDEX TERMS
general failure distributions; optimal checkpointing strategies; rollback and recovery systems; numerical approach; Markov renewal decision process; dynamic decision rule; value-iteration stochastic dynamic programming; finite-element approximation; decision theory; dynamic programming; Markov processes; performance evaluation.
CITATION
P. L'Ecuyer, J. Malenfant, "Computing Optimal Checkpointing Strategies for Rollback and Recovery Systems", IEEE Transactions on Computers, vol.37, no. 4, pp. 491-496, April 1988, doi:10.1109/12.2197
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool