具有软硬截止期限的可分任务的能量感知检查点
Energy-aware checkpointing of divisible tasks with soft or hard deadlines
摘要:
在本文中,我们的目标是最大限度地减少能源消耗时,执行一个可分割的工作量下的总执行时间的约束,而弹性是通过检查点。我们讨论这个多标准问题的几个变种。给定工作负载,我们需要决定使用多少块,这些块的大小,以及每个块的执行速度。此外,由于在块的执行期间可能发生故障,因此我们还需要决定在故障的情况下应该以什么速度重新执行块。目标是最小化总能耗的期望,同时对执行时间强制执行最后期限,该最后期限应在期望(软最后期限)或最坏情况(硬最后期限)下满足。对于每个问题实例,我们提出一个精确的解决方案,或一个可以在数值上优化的函数。然后通过一组广泛的实验比较不同的模型。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。