Solving Agreement Problems with Weak Ordering Oracles
Solving Agreement Problems with Weak Ordering Oracles
复制标题
解决弱排序预言机的协议问题
DOI：
10.1007/3-540-36080-8_5
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
D. Cavin
中科院分区：
文献类型：
--
作者：
F. Pedone;A. Schiper;P. Urbán;D. Cavin
协议问题，如共识，原子广播和组成员，是实现容错分布式系统的核心。尽管在过去的几年里，已经提出了解决协议问题的算法的多样性，几乎所有的解决方案都是基于崩溃检测（CDB）。我们说一个算法是CDB，如果它使用了一些关于进程崩溃/未崩溃状态的信息。在本文中，我们重新审视的非CDB算法考虑订购预言机的问题。对神谕进行排序既有理论上的兴趣，也有实际的兴趣。为了说明它们的使用，我们提出了解决方案的共识和原子广播，并评估在一个工作站集群的原子广播算法的性能。
Agreement problems, such as consensus, atomic broadcast, and group membership, are central to the implementation of fault-tolerant distributed systems. Despite the diversity of algorithms that have been proposed for solving agreement problems in the past years, almost all solutions are Crash-Detection Based (CDB). We say that an algorithm is CDB if it uses some information about the status crashed/not crashed of processes. In this paper, we revisit the issue of non-CDB algorithms considering ordering oracles. Ordering oracles have a theoretical interest as well as a practical interest. To illustrate their use, we present solutions to consensus and atomic broadcast, and evaluate the performance of the atomic broadcast algorithm in a cluster of workstations.