IEICE TRANSACTIONS on Fundamentals
Computational Aspects of Optimal Checkpoint Strategy in Fault-Tolerant Database Management
Summary :
This paper considers a probabilistic model for a database recovery action with checkpoint generations when system failures occur according to a renewal process whose renewal density depends on the cumulative operation period since the last checkpoint. Necessary and sufficient conditions on the existence of the optimal checkpoint interval which maximizes the ergodic availability are analytically derived, and solvable examples are given for the well-known failure time distributions. Further, several methods to be needed for numerical calculations are proposed when the information on system failures is not sufficient. We use four analytical/tractable approximation methods to calculate the optimal checkpoint schedule. Finally, it is shown through numerical comparisons that the gamma approximation method is the best to seek the approximate solution precisely.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.10 pp.2006-2015
- Publication Date
- 1997/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Systems and Control
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tadashi DOHI, Takashi AOKI, Naoto KAIO, Shunji OSAKI, "Computational Aspects of Optimal Checkpoint Strategy in Fault-Tolerant Database Management" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 10, pp. 2006-2015, October 1997, doi: .
Abstract: This paper considers a probabilistic model for a database recovery action with checkpoint generations when system failures occur according to a renewal process whose renewal density depends on the cumulative operation period since the last checkpoint. Necessary and sufficient conditions on the existence of the optimal checkpoint interval which maximizes the ergodic availability are analytically derived, and solvable examples are given for the well-known failure time distributions. Further, several methods to be needed for numerical calculations are proposed when the information on system failures is not sufficient. We use four analytical/tractable approximation methods to calculate the optimal checkpoint schedule. Finally, it is shown through numerical comparisons that the gamma approximation method is the best to seek the approximate solution precisely.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_10_2006/_p
Copy
@ARTICLE{e80-a_10_2006,
author={Tadashi DOHI, Takashi AOKI, Naoto KAIO, Shunji OSAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computational Aspects of Optimal Checkpoint Strategy in Fault-Tolerant Database Management},
year={1997},
volume={E80-A},
number={10},
pages={2006-2015},
abstract={This paper considers a probabilistic model for a database recovery action with checkpoint generations when system failures occur according to a renewal process whose renewal density depends on the cumulative operation period since the last checkpoint. Necessary and sufficient conditions on the existence of the optimal checkpoint interval which maximizes the ergodic availability are analytically derived, and solvable examples are given for the well-known failure time distributions. Further, several methods to be needed for numerical calculations are proposed when the information on system failures is not sufficient. We use four analytical/tractable approximation methods to calculate the optimal checkpoint schedule. Finally, it is shown through numerical comparisons that the gamma approximation method is the best to seek the approximate solution precisely.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Computational Aspects of Optimal Checkpoint Strategy in Fault-Tolerant Database Management
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2006
EP - 2015
AU - Tadashi DOHI
AU - Takashi AOKI
AU - Naoto KAIO
AU - Shunji OSAKI
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1997
AB - This paper considers a probabilistic model for a database recovery action with checkpoint generations when system failures occur according to a renewal process whose renewal density depends on the cumulative operation period since the last checkpoint. Necessary and sufficient conditions on the existence of the optimal checkpoint interval which maximizes the ergodic availability are analytically derived, and solvable examples are given for the well-known failure time distributions. Further, several methods to be needed for numerical calculations are proposed when the information on system failures is not sufficient. We use four analytical/tractable approximation methods to calculate the optimal checkpoint schedule. Finally, it is shown through numerical comparisons that the gamma approximation method is the best to seek the approximate solution precisely.
ER -
English
