关于快速Paxos的协调器规则
On the Coordinator's Rule for Fast Paxos
摘要：
Fast Paxos是一种共识算法，它通过一系列轮来工作，其中每一轮都试图决定一个与所有过去轮一致的值$v$。轮由协调进程启动，一致性由该进程用于选择$v$的规则和称为法定人数的进程集的属性保证。我们展示了这个规则的简化版本的特定情况下，法定人数的基数定义这些进程集。该规则对于算法的实现者来说是特别感兴趣的。
英文摘要：
Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value $v$ that is consistent with all past rounds. Rounds are started by a coordinator process and consistency is guaranteed by the rule used by this process for the selection of $v$ and by the properties of process sets called quorums. We show a simplified version of this rule for the specific case where the quorums are defined by the cardinality of these process sets. This rule is of special interest for implementors of the algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
