The Alpha of Indulgent Consensus
The Alpha of Indulgent Consensus
复制标题
放纵共识的阿尔法
DOI：
10.1093/comjnl/bxl046
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
M. Raynal
中科院分区：
文献类型：
--
作者：
R. Guerraoui;M. Raynal
本文提出了一个简单的框架，统一了一系列共识算法，这些算法可以容忍进程崩溃失败和网络的异步周期，也称为放纵共识算法。该框架的关键是我们在这里引入的一个新的抽象，称为Alpha，它精确地捕获了共识安全性。提出了Alpha在共享内存、存储区域网络、消息传递和活动磁盘系统中的实现，从而直接推导出适合这些通信媒体的共识算法。本文还考虑了进程数量未知且可以任意大的情况。
This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus algorithms. Key to the framework is a new abstraction we introduce here, called Alpha, and which precisely captures consensus safety. Implementations of Alpha in shared memory, storage area network, message passing and active disk systems are presented, leading to directly derived consensus algorithms suited to these communication media. The paper also considers the case where the number of processes is unknown and can be arbitrarily large.