Conference paper Open Access

Optimum Interval for Application-level Checkpoints

Siavvas, Miltiadis; Gelenbe, Erol

Citation Style Language JSON Export

  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.3381007", 
  "language": "eng", 
  "title": "Optimum Interval for Application-level Checkpoints", 
  "issued": {
    "date-parts": [
  "abstract": "<p>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.</p>", 
  "author": [
      "family": "Siavvas, Miltiadis"
      "family": "Gelenbe, Erol"
  "id": "3381007", 
  "event-place": "Paris, France", 
  "version": "1.0", 
  "type": "paper-conference", 
  "event": "6th IEEE International Conference on Cyber Security and Cloud Computing (IEEE CSCloud 2019) (IEEE CSCloud 2019)"
All versions This version
Views 4242
Downloads 6767
Data volume 30.5 MB30.5 MB
Unique views 3939
Unique downloads 6565


Cite as