论文标题
基于领导者的序列Paxos的讲义 - 可理解的序列共识算法
Lecture Notes on Leader-based Sequence Paxos -- An Understandable Sequence Consensus Algorithm
论文作者
论文摘要
在一组过程中以及在存在部分故障的情况下达成协议是分布式系统的基本问题之一。在最普遍的情况下，必须在动态变化会员资格的系统的一生中达成许多决定。这样的决策序列代表分布式日志，可以形成驱动复制状态机的基本抽象。尽管此抽象是许多具有强大一致性要求的系统的核心，但开发人员通常对达到此类序列共识的算法通常对许多分布式系统的学生提出了重大挑战。在这些讲义中，我们提出了一种基于PAXOS的完整且基于PAXOS的算法，用于在失败重回模型中可重新配置的序列共识，并从基本的Paxos算法中逐步转换简单的逐步转换。
Agreement among a set of processes and in the presence of partial failures is one of the fundamental problems of distributed systems. In the most general case, many decisions must be agreed upon over the lifetime of a system with dynamically changing membership. Such a sequence of decisions represents a distributed log, and can form the underlying abstraction for driving a replicated state machine. While this abstraction is at the core of many systems with strong consistency requirements, algorithms that achieve such sequence consensus are often poorly understood by developers and have presented a significant challenge to many students of distributed systems. In these lecture notes we present a complete and practical Paxos-based algorithm for reconfigurable sequence consensus in the fail-recovery model, and a clear path of simple step-by-step transformations to it from the basic Paxos algorithm.
