最终一致性的最弱失效检测器
The Weakest Failure Detector for Eventual Consistency
摘要：
在其经典形式中，一致的复制服务要求所有副本见证服务状态的相同演化。假设一个消息传递环境中的大多数正确的进程，必要的和足够的信息，用于实现一个通用的状态机复制方案，确保一致性的故障是由Ω故障检测器捕获。本文表明，在这样的消息传递环境中，Ω也是实现最终一致的复制服务的最弱故障检测器，其中副本预计只有在一段时间（先验未知）后才会就服务状态的演变达成一致。事实上，我们证明了Ω是在任何消息传递环境中实现最终一致性最弱的，即，在任何关于何时何地可能发生故障的假设下。在任何环境中确保（强）一致性，除了Ω之外，还需要quorum failure detector。因此，我们的论文第一次捕捉到了构建一个确保一致性的复制状态机和一个只确保最终一致性的复制状态机之间的精确计算差异。
英文摘要：
In its classical form, a consistent replicated service requires all replicas to witness the same evolution of the service state. Assuming a message-passing environment with a majority of correct processes, the necessary and sufficient information about failures for implementing a general state machine replication scheme ensuring consistency is captured by the Ω failure detector. This paper shows that in such a message-passing environment, Ω is also the weakest failure detector to implement an eventually consistent replicated service, where replicas are expected to agree on the evolution of the service state only after some (a priori unknown) time. In fact, we show that Ω is the weakest to implement eventual consistency in any message-passing environment, i.e., under any assumption on when and where failures might occur. Ensuring (strong) consistency in any environment requires, in addition to Ω, the quorum failure detector Σ. Our paper thus captures, for the first time, an exact computational difference be- tween building a replicated state machine that ensures consistency and one that only ensures eventual consistency.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
