Skip to main content
SpringerLink
Log in

Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract.

We consider asynchronous consensus in the shared-memory setting. We present the first efficient low-contention consensus algorithm for the weak-adversary-scheduler model. The algorithm achieves consensus in \(O(n\log^2n)\) total work and \(O(\log n)\) (hot-spot) contention, both expected and with high probability. The algorithm assumes the value-oblivious scheduler, which is defined in the paper. Previous efficient consensus algorithms for weak adversaries suffer from \(\Omega(n)\) memory contention.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrahamson K: On achieving consensus using shared memory. In: Proceedings of the 7th Annual ACM Symposium on the Principles of Distributed Computing (PODC), 1988, pp 291-302

  2. Aspnes J: Lower bounds for distributed coin-flipping and randomized consensus. Journal of the ACM 45(3):415-450 (1998)

    Google Scholar 

  3. Aspnes J: Randomized protocols for asynchronous consensus. Distributed Computing 16(2-3):165-175 (2003)

    Google Scholar 

  4. Aspnes J, Herlihy M: Fast randomized consensus using shared memory. Journal of Algorithms 11(3):441-461 (1990)

    Google Scholar 

  5. Aspnes J, Waarts O: Randomized consensus in expected \(O(N\log^2N)\) operations per processor. SIAM Journal on Computing 25(5):1024-1044 (1996)

    Google Scholar 

  6. Attiya H, Lynch N, Shavit N: Are wait-free algorithms fast? In: Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (FOCS), 1990, pp 55-64

  7. Aumann Y: Efficient asynchronous consensus with the weak adversary scheduler. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (PODC), 1997, pp 209-218

  8. Aumann Y, Bender MA: Efficient asynchronous consensus with the value-oblivious adversary scheduler. In: Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP), 1996, pp 622-633

  9. Aumann Y, Bender MA, Zhang L: Efficient execution of nondeterministic parallel programs on asynchronous systems. Information and Computation 139(1):1-16 (1997)

    Google Scholar 

  10. Aumann Y, Kapah-Levy A: Cooperative sharing and asynchronous consensus using single-reader single-writer registers. In: Proceedings of the 10th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), 1999, pp 61-70

  11. Aumann Y, Rabin MO: Clock construction in fully asynchronous parallel systems and pram simulation. Theoretical Computer Science 128:3-30 (1994)

    Google Scholar 

  12. Ben-Or M: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the second annual ACM symposium on Principles of distributed computing, 1983, pp 27-30

  13. Bracha G, Rachman O: Randomized consensus in expected \({O}(n^2\log n)\) operations. In: Proceedings of the 5th International Workshop on Distributed Algorithms (WDAG), vol. 579 of Lecture Notes in Computer Science, 1991, pp 143-150

  14. Chandra TD: Polylog randomized wait-free consenus. In: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing (PODC), 1996, pp 166-175

  15. Chor, B, Israeli A, Li M: Wait-free consensus using asynchronous hardware. SIAM Journal of Computing 23(4):701-712 (1994)

    Google Scholar 

  16. Dolev D, Dwork S, Stockmeyer L: On the minimal synchronism needed for distributed consensus. Journal of the ACM 34(1):77-97 (1987)

    Google Scholar 

  17. Dwork C, Herlihy M, Waarts O: Contention in shared memory algorithms. Journal of the ACM 44(6):779-805 (1997)

    Google Scholar 

  18. Dwork C, Shmoys D, Stockmeyer L: Flipping persuasively in constant time. SIAM Journal of Computing 19(3):472-499 (1990)

    Google Scholar 

  19. Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed commit with one faulty process. Journal of the ACM 32(2):374-382 (1985)

    Google Scholar 

  20. Herlihy M: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1):124-149 (1991)

    Google Scholar 

  21. Loui M, Abu-Amara H: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research 4:163-183 (1987)

    Google Scholar 

  22. Martel C, Park A, Subramonian R: Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In: Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (FOCS), 1990, pp 590-599

  23. Rabin MO: Randomized Byzantine generals. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS), 1983, pp 403-409

  24. Saks M, Shavit N, Woll H: Optimal time randomized consensus - making resilient algorithms fast in practice. In: Proceedings of the 2nd ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), 1991, pp 351-362

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel

    Yonatan Aumann & Michael A. Bender

Authors
  1. Yonatan Aumann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael A. Bender
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yonatan Aumann.

Additional information

Yonatan Aumann: This work was partially completed while theauthor was at Harvard University, supported in part by ONRcontract ONR-N00014-91-J-1981.

Michael A. Bender: This work was supported inpart by HRL Laboratories, Sandia National Laboratories, and NSF GrantsACI-032497, CCR-0208670, and EIA-0112849. This work was partiallycompleted while the author was at Harvard University, supported inpart by NSF grants CCR-9700365, CCR-9504436, and CCR-9313775.

An early version of this paper was presented in the 23rd International Colloquium on Automata, Languages, and Programming (ICALP ‘96) [8].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aumann, Y., Bender, M.A. Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distrib. Comput. 17, 191–207 (2005). https://doi.org/10.1007/s00446-004-0113-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-004-0113-4

Keywords

Search

Navigation