通信诱导检查点历史的倒退
A Rollback in the History of Communication-Induced Checkpointing
摘要：
关于通信诱导检查点的文献提出了一系列使用逻辑时钟来控制是否必须采取强制检查点的协议。这些协议的效率是通过需要多少强制检查点来确保没有检查点对应用程序无用来衡量的;强制检查点越少越好。多年来，HMNR，也称为完全知情（FI），是该系列中最复杂和最有效的协议。Lazy-FI协议采用延迟策略，延迟逻辑时钟的增加，从而使协议在分布式系统中具有更高的效率，其中进程可以以不同的速率采取基本检查点。最近，提出了完全知情和高效（FINE）协议，使用与FI相同的控制结构，但具有更强，可能更好的检查点诱导条件。FINE和它的惰性版本，称为Lazy-FINE，现在将是基于逻辑时钟的最有效的检查点协议。本文回顾了这一系列的协议，证明了一个定理的条件下，必须强制执行的所有更强版本的FI，并证明了，无论是罚款和懒惰罚款不保证没有无用的检查点。因此，FI和Lazy-FI可以回滚到这个基于索引的检查点协议族中最有效的协议的位置。
英文摘要：
The literature on communication-induced checkpointing presents a family of protocols that use logical clocks to control whether forced checkpoints must be taken. Efficiency of these protocols is measured by how many forced checkpoints are needed to ensure no checkpoint will be useless to the application; the fewer forced checkpoints the better. For many years, HMNR, also called Fully Informed (FI), was the most complex and efficient protocol of this family. The Lazy-FI protocol applies a lazy strategy that defers the increase of logical clocks, resulting in a protocol with better efficiency for distributed systems where processes can take basic checkpoints at different rates. Recently, the Fully Informed aNd Efficient (FINE) protocol was proposed using the same control structures as FI, but with a stronger and, presumably better, checkpoint-inducing condition. FINE and its lazy version, called Lazy-FINE, would now be the most efficient checkpointing protocols based on logical clocks. This paper reviews this family of protocols, proves a theorem on a condition that must be enforced by all stronger versions of FI, and proves that both FINE and Lazy-FINE do not guarantee the absence of useless checkpoints. As a consequence, FI and Lazy-FI can be rolled back to the position of most efficient protocols of this family of index-based checkpointing protocols.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
