Conference paper Open Access

Optimum Checkpointing for Long-running Programs

Siavvas, Miltiadis; Gelenbe, Erol


DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.3379889</identifier>
  <creators>
    <creator>
      <creatorName>Siavvas, Miltiadis</creatorName>
      <givenName>Miltiadis</givenName>
      <familyName>Siavvas</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-3251-8723</nameIdentifier>
      <affiliation>Imperial College London, London, United Kingdom</affiliation>
    </creator>
    <creator>
      <creatorName>Gelenbe, Erol</creatorName>
      <givenName>Erol</givenName>
      <familyName>Gelenbe</familyName>
      <affiliation>Institute of Theoretical &amp; Applied Informatics, Polish Academy of Sciences, Gliwice, Poland</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Optimum Checkpointing for Long-running Programs</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2019</publicationYear>
  <subjects>
    <subject>software reliability</subject>
    <subject>roll-back recovery</subject>
    <subject>application-level checkpoints</subject>
    <subject>optimum checkpoints</subject>
    <subject>program loops</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2019-08-28</date>
  </dates>
  <language>en</language>
  <resourceType resourceTypeGeneral="ConferencePaper"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/3379889</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.3379888</relatedIdentifier>
  </relatedIdentifiers>
  <version>1.0</version>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;Checkpoints are widely used to improve the performance of computer systems and programs in the presence of failures, and significantly reduce the cost of restarting a program each time that it fails. Application level checkpointing has been proposed for programs which may execute on platforms which are prone to failures, and also to reduce the execution time of programs which are prone to internal failures. Thus we propose a mathematical model to estimate the average execution time of a program that operates in the presence of dependability failures, without and with application level checkpointing, and use it to estimate the optimum interval in number of instructions executed between successive checkpoints. Specific emphasis is given on programs with loops, whereas the results are illustrated through simulation.&lt;/p&gt;</description>
  </descriptions>
  <fundingReferences>
    <fundingReference>
      <funderName>European Commission</funderName>
      <funderIdentifier funderIdentifierType="Crossref Funder ID">10.13039/501100000780</funderIdentifier>
      <awardNumber awardURI="info:eu-repo/grantAgreement/EC/H2020/780572/">780572</awardNumber>
      <awardTitle>Software Development toolKit for Energy optimization and technical Debt elimination</awardTitle>
    </fundingReference>
  </fundingReferences>
</resource>
74
53
views
downloads
All versions This version
Views 7474
Downloads 5353
Data volume 35.5 MB35.5 MB
Unique views 6767
Unique downloads 4949

Share

Cite as