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

以可用性为目标函数的最优检查点间隔

Optimal Checkpoint Interval with Availability as an Objective Function

Nirmal Raj Saxena, Saurabh Hukerikar, Mikolaj Blaz, Swapna Raj

AI总结:

本文重新推导了Young_1974的最优检查点间隔,并提出以可用性为目标的最优检查点间隔,证明其在特定条件下与损失时间最优解渐近一致,同时分析了错误检测延迟对最优间隔的影响。

摘要:

我们给出了Young_1974 [1]中最优检查点间隔的简化推导。[1]中的最优检查点间隔推导基于最小化总损失时间这一目标函数。损失时间是检查点间隔、检查点保存时间和平均故障时间的函数。该简化推导得到的损失时间最优值与[1]中推导的结果相同。对于大规模横向扩展超级计算机或数据中心系统而言,重要的是选择能够最大化可用性的最优检查点间隔。我们证明,以可用性为最优的检查点间隔不同于[1]中推导的结果。然而,在检查点保存时间和恢复时间满足特定条件时,以可用性为最优的检查点间隔与以损失时间为最优的检查点间隔渐近相同。我们证明,当错误检测延迟显著小于任何所选检查点间隔时,这些最优检查点间隔成立。然而,当错误检测延迟非常大时,最优检查点间隔大于或等于错误检测延迟。

英文摘要:

We present a simplified derivation of the optimal checkpoint interval in Young_1974 [1]. The optimal checkpoint interval derivation in [1] is based on minimizing the total lost time as an objective-function. Lost time is a function of checkpoint interval, checkpoint save time, and average failure time. This simplified derivation yields lost-time-optimal that is identical to the one derived in [1]. For large scale-out super-computer or datacenter systems, what is important is the selection of optimal checkpoint interval that maximizes availability. We show that availability-optimal checkpoint interval is different from the one derived in [1]. However, availability-optimal checkpoint interval is asymptotically same as lost-time-optimal checkpoint interval for certain conditions on checkpoint save and recovery time. We show that these optimal checkpoint intervals hold in situations where the error detection latency is significantly smaller than any selected checkpoint interval. However, in cases where the error detection latency is very large then the optimal checkpoint interval is greater than or equal to the error detection latency.

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

↑