10.5281/zenodo.3381007
https://zenodo.org/records/3381007
oai:zenodo.org:3381007
Siavvas, Miltiadis
Miltiadis
Siavvas
0000-0002-3251-8723
Imperial College London, London, United Kingdom
Gelenbe, Erol
Erol
Gelenbe
Institute of Theoretical & Applied Informatics, Polish Academy of Sciences, Gliwice, Poland
Optimum Interval for Application-level Checkpoints
Zenodo
2019
Cloud Computing
Software Reliability
Roll- Back Recovery
Application Level Checkpoints
Optimum Checkpoints
Program Loops
2019-08-29
eng
10.5281/zenodo.3381006
https://zenodo.org/communities/eu
1.0
Creative Commons Attribution 4.0 International
Checkpointing is commonly adopted for enhancing the performance of software applications that operate in the presence of failures. Among the existing checkpointing strategies, Application-level Checkpoint and Restart (ALCR) is considered the most efficient, since it leaves smaller memory footprint, but it requires significant development effort. Although existing ALCR tools and libraries manage to reduce the effort required for implementing the checkpoints, they do not provide recommendations regarding their inter-checkpoint interval. To this end, in the present paper, we develop a mathematical model to estimate the optimum checkpoint interval, i.e., the interval between two successive checkpoints that minimises the average execution time of the application. The case of programs with loops and nested loops is also discussed. The results are illustrated with several numerical examples.
European Commission
10.13039/501100000780
780572
Software Development toolKit for Energy optimization and technical Debt elimination