Energy-aware checkpointing of divisible tasks with soft or hard deadlines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

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

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.
Fichier principal
Vignette du fichier
igcc2013.pdf (214.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00857244 , version 1 (03-09-2013)

Identifiers

  • HAL Id : hal-00857244 , version 1

Cite

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⟩
339 View
102 Download

Share

Gmail Facebook Twitter LinkedIn More