Energy-aware checkpointing of divisible tasks with soft or hard deadlines
AUPY, Guillaume
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
BENOIT, Anne
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
See more >
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
AUPY, Guillaume
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
BENOIT, Anne
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
RENAUD-GOUD, Paul
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
ROBERT, Yves
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
< Reduce
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]
Language
en
Communication dans un congrès
This item was published in
IGCC - 4th International Green Computing Conference - 2013, 2013-06-27, Arlington. 2013-02-01
English 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 ...Read more >
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.Read less <
ANR Project
Résilience des applications scientifiques sur machines exascales - ANR-10-BLAN-0301
Origin
Hal imported