异步易崩溃系统中的自稳定多值一致性
Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems
摘要：
多值一致性问题是容错分布式计算领域的基础，因为它抽象了一组非常广泛的一致性问题，其中进程必须统一决定V中的特定值v，其中|V| >1。现有的解决方案（容忍过程故障）将多值共识问题减少到二元共识问题，例如，莫斯特法维-雷纳-特罗内尔和张晨我们的研究旨在设计一种更可靠的解决方案。我们是通过自我稳定的视角来这样做的-这是一个非常强的容错概念。除了节点和通信故障之外，自稳定算法可以在任意瞬时故障发生后恢复;这些故障表示任何违反系统设计操作所依据的假设的行为（只要算法代码保持完整）。这项工作提出了第一个（据我们所知）自稳定算法的多值共识异步消息传递系统容易出现进程故障和任意瞬态故障。我们的解决方案也是第一个（据我们所知）支持等待自由的解决方案。此外，使用piggybacking技术，我们的解决方案可以同时调用n个二进制共识对象。因此，所提出的自稳定无等待解决方案可以使用比Mostefaoui，Raynal和Tronel的早期非自稳定解决方案更少的资源来终止，该解决方案使用无限数量的二进制共识对象，或者Zhang和Chen，这不是无等待的。
英文摘要：
The problem of multivalued consensus is fundamental in the area of fault-tolerant distributed computing since it abstracts a very broad set of agreement problems in which processes have to uniformly decide on a specific value v in V, where |V| >1. Existing solutions (that tolerate process failures) reduce the multivalued consensus problem to the one of binary consensus, e.g., Mostefaoui-Raynal-Tronel and Zhang-Chen. Our study aims at the design of an even more reliable solution. We do so through the lenses of self-stabilization -- a very strong notion of fault-tolerance. In addition to node and communication failures, self-stabilizing algorithms can recover after the occurrence of arbitrary transient-faults; these faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code stays intact). This work proposes the first (to the best of our knowledge) self-stabilizing algorithm for multivalued consensus for asynchronous message-passing systems prone to process failures and arbitrary transient-faults. Our solution is also the first (to the best of our knowledge) to support wait-freedom. Moreover, using piggybacking techniques, our solution can invoke n binary consensus objects concurrently. Thus, the proposed self-stabilizing wait-free solution can terminate using fewer resources than earlier non-self-stabilizing solutions by Mostefaoui, Raynal, and Tronel, which uses an unbounded number of binary consensus objects, or Zhang and Chen, which is not wait-free.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
