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
* Auteur correspondant
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.
Type de document :
Communication dans un congrès
IGCC - 4th International Green Computing Conference - 2013, Jun 2013, Arlington, United States. 2013
Liste complète des métadonnées

https://hal.inria.fr/hal-00857244
Contributeur : Equipe Roma <>
Soumis le : mardi 3 septembre 2013 - 11:12:43
Dernière modification le : vendredi 20 avril 2018 - 15:44:27
Document(s) archivé(s) le : jeudi 6 avril 2017 - 14:35:55

Fichier

igcc2013.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00857244, version 1

Citation

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. 2013. 〈hal-00857244〉

Partager

Métriques

Consultations de la notice

495

Téléchargements de fichiers

86