用稳定骨架图求解k-集一致性
Solving k-Set Agreement with Stable Skeleton Graphs
摘要：
在本文中，我们认为在分布式消息传递系统中的k-集协议问题，使用一个基于轮的方法：通信和故障的同步捕获只是通过一轮内到达的消息，从而在一轮又一轮的通信图，其特征在于简单的通信谓词。我们引入了弱通信谓词Pssk（k），并证明了它对于k-集一致性是紧的，在以下意义上：我们（i）证明了在Pssk（k）所表征的系统中没有求解（k-1）-集一致性的算法，以及（ii）提出了一种新的分布式算法，该算法在Pssk（k）成立的运行中实现了k-集一致性。我们的算法使用本地近似的稳定骨架图，这反映了潜在的永久同步运行。我们证明，这种近似是正确的，在所有的运行，无论通信谓词，并表明，图论性质的稳定骨架图可以用来解决k-集协议，如果PSTK（k）举行。
英文摘要：
In this paper we consider the k-set agreement problem in distributed message-passing systems using a round-based approach: Both synchrony of communication and failures are captured just by means of the messages that arrive within a round, resulting in round-by-round communication graphs that can be characterized by simple communication predicates. We introduce the weak communication predicate PSources(k) and show that it is tight for k-set agreement, in the following sense: We (i) prove that there is no algorithm for solving (k-1)-set agreement in systems characterized by PSources(k), and (ii) present a novel distributed algorithm that achieves k-set agreement in runs where PSources(k) holds. Our algorithm uses local approximations of the stable skeleton graph, which reflects the underlying perpetual synchrony of a run. We prove that this approximation is correct in all runs, regardless of the communication predicate, and show that graph-theoretic properties of the stable skeleton graph can be used to solve k-set agreement if PSources(k) holds.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
