Bounded polynomial randomized consensus

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing Pub Date : 1989-06-01 DOI:10.1145/72981.73001

H. Attiya, D. Dolev, N. Shavit

引用次数: 54

Abstract

Abstract : In (A88), Abrahamson presented a solution to the randomized consensus problem of Chor, Israeli and Li (CIL87), without assuming the existence of anatomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected exponential running time. In (AH89), Aspens and Herlihy provide a breakthrough polynomial-time algorithm. However, it too is based on the use of unbounded memory. In this paper, we present a solution to the randomized consensus problem, that is bounded in space and runs in polynomial expected time.

查看原文本刊更多论文

有界多项式随机一致

摘要:在(A88)中，Abrahamson提出了Chor, israel和Li (CIL87)的随机共识问题的解决方案，而不假设存在解剖上的抛硬币操作。这种优雅的算法使用无界内存，并具有预期的指数级运行时间。在(AH89)中，Aspens和Herlihy提供了一个突破性的多项式时间算法。然而，它也是基于无限内存的使用。本文给出了随机共识问题的一个解，该解在空间上有界，在多项式期望时间内运行。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing

CiteScore

4.50

自引率

0.00%

发文量