木筏
计算机科学
复制(统计)
一致性算法
分布式计算
钥匙(锁)
理论计算机科学
算法
计算机安全
数学
化学
共聚物
统计
有机化学
聚合物
作者
Diego Ongaro,John K. Ousterhout
出处
期刊:USENIX Annual Technical Conference
日期:2014-06-19
卷期号:: 305-320
被引量:1468
摘要
Raft is a consensus algorithm for managing a replicated log. It produces a result equivalent to (multi-)Paxos, and it is as efficient as Paxos, but its structure is different from Paxos; this makes Raft more understandable than Paxos and also provides a better foundation for building practical systems. In order to enhance understandability, Raft separates the key elements of consensus, such as leader election, log replication, and safety, and it enforces a stronger degree of coherency to reduce the number of states that must be considered. Results from a user study demonstrate that Raft is easier for students to learn than Paxos. Raft also includes a new mechanism for changing the cluster membership, which uses overlapping majorities to guarantee safety.
科研通智能强力驱动
Strongly Powered by AbleSci AI