arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0412116cs.DC
收藏

分布式计算中的约简部分II:k-阈值协议任务

Reductions in Distributed Computing Part II: k-Threshold Agreement Tasks

Bernadette Charron-Bost

摘要:

我们通过考虑一类新的协议任务,即所谓的k阈值协议任务(以前由Charron-Bost和Le Fessant介绍),扩展了第一部分的结果。这些任务自然介于原子承诺和共识之间。此外,它们构成了一个有价值的工具,可以在共识任务之间获得不可约化的结果。特别是,它们使我们能够证明:(A)对于固定的过程集合,弹性程度越高,共识任务越难;(B)对于固定的弹性程度,过程集合越小,共识任务越难。这些结果的证明使我们考虑新的基于预言机的约简,涉及第一部分中介绍的C-约简的较弱变体。我们还讨论了我们的结果和以前的有关f-弹性和等待自由之间的关系。

英文摘要:

We extend the results of Part I by considering a new class of agreement tasks, the so-called k-Threshold Agreement tasks (previously introduced by Charron-Bost and Le Fessant). These tasks naturally interpolate between Atomic Commitment and Consensus. Moreover, they constitute a valuable tool to derive irreducibility results between Consensus tasks only. In particular, they allow us to show that (A) for a fixed set of processes, the higher the resiliency degree is, the harder the Consensus task is, and (B) for a fixed resiliency degree, the smaller the set of processes is, the harder the Consensus task is. The proofs of these results lead us to consider new oracle-based reductions, involving a weaker variant of the C-reduction introduced in Part I. We also discuss the relationship between our results and previous ones relating f-resiliency and wait-freedom.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑