arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.4216cs.DS
收藏

具有改进的最坏情况保证的在线检查点

Online Checkpointing with Improved Worst-Case Guarantees

Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan

摘要:

在在线检查点问题中,任务是连续维护一组k个检查点,这些检查点允许比完全重启更快地倒带正在进行的计算。唯一允许的操作是将旧检查点替换为当前状态。我们的目标是最小化倒带成本的检查点放置策略,即,使得在所有时间T,当被请求倒回到某个时间t <= T时,需要重做以从t之前的检查点到达t的计算步骤的数量尽可能小。特别地,我们希望比t更早的最近检查点距离t不超过q_k乘以理想距离T /(k+1),其中q_k是一个小常数。改进了以前的工作,显示1 + 1/k <= q_k <= 2,我们证明了q_k可以选择渐近小于2。我们给出了一个算法,其渐近偏差q_k <= 1.59 + o(1)对所有k都有效,q_k <= ln(4)+ o(1)<= 1.39 + o(1)对k是2的幂次有效.实验表明,对所有k,p_k <= 1.7是一致的.对于小k,我们展示了如何使用线性规划方法来计算好的检查点算法。这给出了对于所有k < 60的小于1.55的差异。我们证明了第一个渐近大于1的下界,即q_k >= 1.30 - o(1)。我们还表明,最佳算法(产生的下确界差异)存在的所有k。

英文摘要:

In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only operation allowed is to replace an old checkpoint by the current state. Our aim are checkpoint placement strategies that minimize rewinding cost, i.e., such that at all times T when requested to rewind to some time t <= T the number of computation steps that need to be redone to get to t from a checkpoint before t is as small as possible. In particular, we want that the closest checkpoint earlier than t is not further away from t than q_k times the ideal distance T / (k+1), where q_k is a small constant. Improving over earlier work showing 1 + 1/k <= q_k <= 2, we show that q_k can be chosen asymptotically less than 2. We present algorithms with asymptotic discrepancy q_k <= 1.59 + o(1) valid for all k and q_k <= ln(4) + o(1) <= 1.39 + o(1) valid for k being a power of two. Experiments indicate the uniform bound p_k <= 1.7 for all k. For small k, we show how to use a linear programming approach to compute good checkpointing algorithms. This gives discrepancies of less than 1.55 for all k < 60. We prove the first lower bound that is asymptotically more than one, namely q_k >= 1.30 - o(1). We also show that optimal algorithms (yielding the infimum discrepancy) exist for all k.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑