article

Free access

On the Optimum Checkpoint Interval

Author:

Erol GelenbeAuthors Info & Claims

Journal of the ACM (JACM), Volume 26, Issue 2

Pages 259 - 270

https://doi.org/10.1145/322123.322131

Published: 01 April 1979 Publication History

PDF eReader

References

[1]

BOROVKOV, A A Stochasnc Processes m Queuemg Theory Spnnger-Verlag, New York, 1976

Google Scholar

[2]

CHANDY, K M A survey of analyuc models of roll-back and recovery strategies Computer 8, 5 (May 1975), 40-47

Google Scholar

[3]

CnANDY, K M, BgowNw, J C, DISSLY, C W, AND UHRIG, W R AnalyUc models for rollback and recovery strategies m data base systems IEEE Trans Software Eng. SE-1, 1 (March 1975), 100--110

Google Scholar

[4]

(~INLAR, E Introductton to Stochast:c Processes Prentlce-HaU, Englewood Chffs, N J, 1975

Google Scholar

[5]

Cox, D R Renewal Theory Methuen, London, 1962

Google Scholar

[6]

Cox, D R, AND LEWIS, P A W The Stattst~cal Analysts of Serws of Events Methuen, London, 1966.

Google Scholar

[7]

FLAMAND, J, AND GELENBE, E Sunulatlon of roll-back recovery m a data-base system To appear

Google Scholar

[8]

GELENBE, E A model of roll-back recovery wtth multiple checkpoints Proc 2nd Int Symp on Software Eng, Oct 1976, pp 251-255 (available from ACM, New York)

Crossref

Google Scholar

[9]

GELENBE, E, AND DEROCHETTE, D On the stochast|c behaviour of a computer system under mterm,ttent failures In Modelhng and Performance Evaluaaon of Computer Systems, H Bedner and E Gelenbe, Eds, North-Holland Pub Co, Amsterdam, 1976

Google Scholar

[10]

KOVALENKO, I N, AND STOIKOVA, L S On the producUvRy of a system and the problem solving tune m the presence of random failures and aperiodic memorization of the results Transl from Ktbernettka, issue no 5 (Sept-Oct 1974), 73-75 (Cybernencs I0, 5 (Feb 1976), 820--823, Plenum Pub. Corp, New York).

Google Scholar

[11]

LOYNES, R M The stability of a queue wRh non-mdependent mterarnval and service tunes. Proc Cambrtdge Phdos. Soc 58 (1962), 497-520

Google Scholar

[12]

PAKES, A G Some condmons for ergo&city and recurrence of Markov chains Oper Res 17 (1969), 1058- 1061

Google Scholar

[13]

ROBIN, M Quelques probl6mes de contr61e stochasuque Th, U Pans-Dauphine, 1978

Google Scholar

[14]

TAKACS, L Introduct:on to the Theory of Queues Oxford U Press, New York, 1962

Google Scholar

[15]

YOUNG, J W A first-order approxtmaUon to the optimum checkpoint interval Comm. A CM 17, 9 (Sept 1974), 530-531

Crossref

Google Scholar

Cited By

View all

Ezhilchelvan PMitrani I(2024)Checkpointing models for tasks of different typesACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/36586679:3(1-23)Online publication date: 13-Apr-2024
https://dl.acm.org/doi/10.1145/3658667
Reghenzani FGuo ZFornaciari W(2023)Software Fault Tolerance in Real-Time Systems: Identifying the Future Research QuestionsACM Computing Surveys10.1145/358995055:14s(1-30)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1145/3589950
Ansari MSafari SKhdr HGohari-Nazari PHenkel JEjlali AHessabi S(2022)Power-Aware Checkpointing for Multicore Embedded SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.318856833:12(4410-4424)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1109/TPDS.2022.3188568
Show More Cited By

Index Terms

On the Optimum Checkpoint Interval
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database transaction processing
        Database recovery
      2. Distributed database transactions
        Distributed database recovery
2. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory

Recommendations

A first order approximation to the optimum checkpoint interval

To avoid having to restart a job from the beginning in case of random failure, it is standard practice to save periodically sufficient information to enable the job to be restarted at the previous point at which information was saved. Such points are ...
Selecting the checkpoint interval in time warp simulation
PADS '93: Proceedings of the seventh workshop on Parallel and distributed simulation

In Time Warp parallel simulation, the state of each process must be saved (checkpointed) regularly in case a rollback is necessary. Although most existing Time Warp implementations checkpoint after every state transition, this is not necessary, and the ...
The Optimal Checkpoint Interval for the Long-Running Application

For the distributed computing system, excessive or deficient checkpointing operations would result in severe performance degradation. To minimize the expected computation execution of the long-running application with a general failure distribution, the ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 26, Issue 2

April 1979

205 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322123

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1979

Published in JACM Volume 26, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

172
Total Citations
View Citations
927
Total Downloads

Downloads (Last 12 months)86
Downloads (Last 6 weeks)8

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ezhilchelvan PMitrani I(2024)Checkpointing models for tasks of different typesACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/36586679:3(1-23)Online publication date: 13-Apr-2024
https://dl.acm.org/doi/10.1145/3658667
Reghenzani FGuo ZFornaciari W(2023)Software Fault Tolerance in Real-Time Systems: Identifying the Future Research QuestionsACM Computing Surveys10.1145/358995055:14s(1-30)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1145/3589950
Ansari MSafari SKhdr HGohari-Nazari PHenkel JEjlali AHessabi S(2022)Power-Aware Checkpointing for Multicore Embedded SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.318856833:12(4410-4424)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1109/TPDS.2022.3188568
Ezhilchelvan PMitrani I(2022)Checkpointing Models for Tasks with Widely Different Processing TimesComputer Performance Engineering10.1007/978-3-031-25049-1_7(100-114)Online publication date: 21-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-25049-1_7
Gelenbe ESiavvas M(2021)Minimizing Energy and Computation in Long-Running SoftwareApplied Sciences10.3390/app1103116911:3(1169)Online publication date: 27-Jan-2021
https://doi.org/10.3390/app11031169
Koren IKrishna C(2021)CheckpointingFault-Tolerant Systems10.1016/B978-0-12-818105-8.00016-4(203-235)Online publication date: 2021
https://doi.org/10.1016/B978-0-12-818105-8.00016-4
Jafary BFiondella LChang P(2020)Optimal equidistant checkpointing of fault tolerant systems subject to correlated failureProceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability10.1177/1748006X19893569(1748006X1989356)Online publication date: 4-May-2020
https://doi.org/10.1177/1748006X19893569
Bar-On ADinur IDunkelman OHod RKeller NRonen EShamir A(2020)Tight Bounds on Online Checkpointing AlgorithmsACM Transactions on Algorithms10.1145/337954316:3(1-22)Online publication date: 6-Jun-2020
https://dl.acm.org/doi/10.1145/3379543
Gelenbe EBoryszko PSiavvas MDomanska J(2020)Optimum Checkpoints for Time and Energy2020 28th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS50786.2020.9285959(1-8)Online publication date: 17-Nov-2020
https://doi.org/10.1109/MASCOTS50786.2020.9285959
Siavvas MGelenbe E(2019)Optimum Interval for Application-level Checkpoints2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)10.1109/CSCloud/EdgeCom.2019.000-4(145-150)Online publication date: Jun-2019
https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-4
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

A first order approximation to the optimum checkpoint interval

Selecting the checkpoint interval in time warp simulation

The Optimal Checkpoint Interval for the Long-Running Application

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations