放松的Paxos：Quorum Intersection Revisited（再次）
Relaxed Paxos: Quorum Intersection Revisited (Again)
摘要：
分布式共识，即在故障面前达成一致的能力，是构建可靠分布式系统的基本原语。Paxos算法是共识的同义词，在生产中得到广泛应用。Paxos使用两个阶段：第一阶段和第二阶段，每个阶段都需要法定数量的接受者，以在一轮协议中达成共识。传统上，Paxos要求所有法定人数，无论阶段或回合，相交和多数通常用于此目的。Flexible Paxos证明了一个给定回合的第一阶段法定人数只需要与所有先前回合的第二阶段法定人数相交。在本文中，我们将重新审视Paxos如何处理共识问题。我们再次查看Flexible Paxos中的quorum intersection，并观察到quorum intersection可以安全地进一步削弱。最值得注意的是，我们观察到，如果一个提议者知道一个值是在前一轮中提出的，那么它的第一阶段不再需要与该轮或任何前一轮的第二阶段法定人数相交。此外，为了提供一个直观的解释，我们的结果，我们提出了一个新的抽象的推理Paxos利用一次写入寄存器。
英文摘要：
Distributed consensus, the ability to reach agreement in the face of failures, is a fundamental primitive for constructing reliable distributed systems. The Paxos algorithm is synonymous with consensus and widely utilized in production. Paxos uses two phases: phase one and phase two, each requiring a quorum of acceptors, to reach consensus during a round of the protocol. Traditionally, Paxos requires that all quorums, regardless of phase or round, intersect and majorities are often used for this purpose. Flexible Paxos proved that it is only necessary for phase one quorum of a given round to intersect with the phase two quorums of all previous rounds. In this paper, we re-examine how Paxos approaches the problem of consensus. We look again at quorum intersection in Flexible Paxos and observe that quorum intersection can be safely weakened further. Most notably, we observe that if a proposer learns that a value was proposed in some previous round then its phase one no longer needs to intersect with the phase two quorums from that round or from any previous rounds. Furthermore, in order to provide an intuitive explanation of our results, we propose a novel abstraction for reasoning about Paxos which utilizes write-once registers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
