实际自稳定虚拟同步
Practically-Self-Stabilizing Virtual Synchrony
摘要：
虚拟同步是一个重要的抽象，当在异步的、通常是大型的、消息传递的分布式系统上实现时，它被证明是非常有用的。容错设计是此类实现成功的关键标准。这是因为大型分布式系统可以是高度可用的，只要它们不依赖于每个系统参与者的完整操作状态。也就是说，他们采用冗余的数字，以克服非最佳行为的参与者，并获得全球的鲁棒性和高可用性。自稳定系统可以容忍瞬态故障，驱动系统到一个任意的不可预测的配置。这样的系统会自动从任意配置中恢复一致性，然后产生所需的系统行为。实际上，自稳定系统确保了实际上无限数量的连续步骤的期望系统行为，$2^{64}$步骤。我们提出了第一个实际的自稳定虚拟同步算法。该算法是几个新技术的组合，可能是独立的利益。特别是，我们提出了一种新的计数器算法，建立了一个有效的实际无界计数器，这反过来又可以直接用于实现自稳定多写多读（MWMR）寄存器仿真。其他组件包括自稳定组成员资格、自稳定多播和复制状态机的自稳定仿真。当我们基于虚拟同步而不是共识来实现复制状态机时，系统在与基于共识的复制状态机相关的更极端的异步执行中前进。
英文摘要：
Virtual synchrony is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is a key criterion for the success of such implementations. This is because large distributed systems can be highly available as long as they do not depend on the full operational status of every system participant. Namely, they employ redundancy in numbers to overcome non-optimal behavior of participants and to gain global robustness and high availability. Self-stabilizing systems can tolerate transient faults that drive the system to an arbitrary unpredicted configuration. Such systems automatically regain consistency from any such arbitrary configuration, and then produce the desired system behavior. Practically self-stabilizing systems ensure the desired system behavior for practically infinite number of successive steps e.g., $2^{64}$ steps. We present the first practically self-stabilizing virtual synchrony algorithm. The algorithm is a combination of several new techniques that may be of independent interest. In particular, we present a new counter algorithm that establishes an efficient practically unbounded counter, that in turn can be directly used to implement a self-stabilizing Multiple-Writer Multiple-Reader (MWMR) register emulation. Other components include self-stabilizing group membership, self-stabilizing multicast, and self-stabilizing emulation of replicated state machine. As we base the replicated state machine implementation on virtual synchrony, rather than consensus, the system progresses in more extreme asynchronous executions in relation to consensus-based replicated state machine.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
