Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/IGCC.2013.6604467 | Green Computing Conference |
Keywords | DocType | Volume |
checkpointing,energy consumption,power aware computing,divisible task,energy consumption,energy-aware checkpointing,hard deadline,soft deadline | Conference | abs/1302.3720 |
Citations | PageRank | References |
4 | 0.39 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Aupy | 1 | 4 | 0.39 |
| Anne Benoit | 2 | 65 | 7.74 |
| R. Melhem | 3 | 4 | 0.73 |
| Paul Renaud-Goud | 4 | 35 | 6.57 |