HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Energy-aware checkpointing of divisible tasks with soft or hard deadlines

Guillaume Aupy 1, 2, * Anne Benoit 1, 2, * Rami Melhem 3, * Paul Renaud-Goud 4, * Yves Robert 1, 2
* Corresponding author
2 ROMA - Optimisation des ressources : modèles, algorithmes et ordonnancement
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
4 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : In this paper, we aim at minimizing the energy consumption when executing a divisible workload under a bound on the total execution time, while resilience is provided through checkpointing. We discuss several variants of this multi-criteria problem. Given the workload, we need to decide how many chunks to use, what are the sizes of these chunks, and at which speed each chunk is executed. Furthermore, since a failure may occur during the execution of a chunk, we also need to decide at which speed a chunk should be re-executed in the event of a failure. The goal is to minimize the expectation of the total energy consumption, while enforcing a deadline on the execution time, that should be met either in expectation (soft deadline), or in the worst case (hard deadline). For each problem instance, we propose either an exact solution, or a function that can be optimized numerically.
Document type :
Conference papers
Complete list of metadata

Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Tuesday, September 3, 2013 - 11:12:43 AM
Last modification on : Monday, May 16, 2022 - 4:46:02 PM
Long-term archiving on: : Thursday, April 6, 2017 - 2:35:55 PM


Files produced by the author(s)


  • HAL Id : hal-00857244, version 1


Guillaume Aupy, Anne Benoit, Rami Melhem, Paul Renaud-Goud, Yves Robert. Energy-aware checkpointing of divisible tasks with soft or hard deadlines. IGCC - 4th International Green Computing Conference - 2013, Jun 2013, Arlington, United States. ⟨hal-00857244⟩



Record views


Files downloads