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

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. The different models are then compared through an extensive set of experiments.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

Contributor : Guillaume Pallez (aupy) Connect in order to contact the contributor
Submitted on : Thursday, February 14, 2013 - 6:25:46 PM
Last modification on : Monday, May 16, 2022 - 4:46:02 PM
Long-term archiving on: : Sunday, April 2, 2017 - 12:05:15 AM


Files produced by the author(s)


  • HAL Id : hal-00788641, version 1


Guillaume Aupy, Anne Benoit, Rami Melhem, Paul Renaud-Goud, Yves Robert. Energy-aware checkpointing of divisible tasks with soft or hard deadlines. [Research Report] RR-8238, INRIA. 2013, pp.33. ⟨hal-00788641⟩



Record views


Files downloads