Skip to Main content Skip to Navigation
New interface
Reports (Technical report)

An optimal algorithm for scheduling checkpoints with variable costs

Mohamed Slim Bouguerra 1 Denis Trystram 1 Frédéric Wagner 1 
1 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Since the last decade, computing systems turn to large scale parallel platforms composed of thousands of processors. Many actual applications run on such systems for long duration, up to several days or weeks. Recently, statistic studies about failures on high performance computing platforms emphasize that the mean time between failures may not exceed few hours. Thus, it is necessary to develop effcient strategies providing a safe and reliable completion of applications. This may be achieved through redundancy or by storing intermediate computation states on reliable external devices. Saved states are then used to restart computations from the last checkpoint. This last approach called checkpointing is one of the most popular fault tolerance technique in parallel systems.
Document type :
Reports (Technical report)
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Mohamed Slim Bouguerra Connect in order to contact the contributor
Submitted on : Monday, January 24, 2011 - 1:24:36 PM
Last modification on : Thursday, October 27, 2022 - 4:03:06 AM
Long-term archiving on: : Friday, December 2, 2016 - 7:06:41 PM


Files produced by the author(s)


  • HAL Id : inria-00558861, version 1


Mohamed Slim Bouguerra, Denis Trystram, Frédéric Wagner. An optimal algorithm for scheduling checkpoints with variable costs. [Technical Report] 2010. ⟨inria-00558861⟩



Record views


Files downloads