James Aspnes
Hagit Attiya
ABSTRACT
This paper presents a new randomized algorithm for achieving consensus among asynchronous processes that communicate by reading and writing shared registers, in the presence of a strong adversary. The fastest previously known algorithm requires a process to perform an expected O(n log2 n) read and write operations in the worst case. In our algorithm, each process executes at most an expected O(n log n) read and write operations. It is shown that shared-coin algorithms can be combined together to yield an algorithm with O(n log n) individual work and O(n2) total work.
- K. Abrahamson. On achieving consensus using a shared memory. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 291--302, 1988. Google Scholar
Digital Library
- J. Aspnes. Time- and space-efficient randomized consensus. J. Algorithms, 14(3):414--431, 1993. Google ScholarDigital Library
- J. Aspnes. Randomized protocols for aynchronous consensus. Distributed Computing, 16(2-3):165--176, Sept. 2003. Google ScholarDigital Library
- J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441--461, 1990. Google ScholarDigital Library
- J. Aspnes and O. Waarts. Randomized consensus in expected O(n łog2n) operations per processor. SIAM J. Comput., 25(5):1024--1044, 1996. Google ScholarDigital Library
- H. Attiya and K. Censor. Tight bounds for asynchronous randomized consensus. In Proceedings of the 39th annual ACM symposium on Theory of computing (STOC), pages 155--164, 2007. Google ScholarDigital Library
- G. Bracha and O. Rachman. Randomized consensus in expected O(n2łogn) operations. In Proceedings of the 5th International Workshop on Distributed Algorithms (WDAG), pages 143--150, 1991. Google ScholarDigital Library
- M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374--382, Apr. 1985. Google ScholarDigital Library
- M. Herlihy. Wait-free synchronization. ACM Trans. Prog. Lang. Syst., 13(1):124--149, January 1991. Google ScholarDigital Library
- L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133--169, May 1998. Google ScholarDigital Library
- M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, pages 163--183, 1987.Google Scholar
- N. A. Lynch, R. Segala, and F. W. Vaandrager. Observing branching structure through probabilistic contexts. SIAM J. Comput., 37(4):977--1013, 2007. Google ScholarDigital Library
- M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensus--making resilient algorithms fast in practice. In Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms, pages 351--362, 1991. Google ScholarDigital Library
- F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv., 22(4):299--319, Dec. 1990. Google ScholarDigital Library
Index Terms
- Randomized consensus in expected O(n log n) individual work
Recommendations
Lower bounds for randomized consensus under a weak adversary
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computingThis paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the probability that an f-resilient randomized consensus algorithm of n processes ...
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that guarantees termination and validity, but that only guarantees agreement with ...
Randomized Consensus in Expected O(n log^ 2 n) Operations Per Processor
This paper presents a new randomized algorithm for achieving consensus among asynchronous processors that communicate by reading and writing shared registers. The fastest previously known algorithm requires a processor to perform an expected $O(n^2 \...
Comments