Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Distributed Computing

DISC 2011: Distributed Computing pp 363–373Cite as

Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6950))

Abstract

A new weak shared coin protocol yields a randomized wait-free shared-memory consensus protocol that uses an optimal O(n 2) expected total work with single-writer registers despite asynchrony and process crashes. Previously, no protocol was known that achieved this bound without using multi-writer registers.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons, Chichester (1992)

    MATH  Google Scholar 

  3. Aspnes, J.: Time- and space-efficient randomized consensus. Journal of Algorithms 14(3), 414–431 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Aspnes, J., Censor, K.: Approximate shared-memory counting despite a strong adversary. In: SODA 2009: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, pp. 441–450. Society for Industrial and Applied Mathematics, Philadelphia (2009)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Aspnes, J., Waarts, O.: Randomized consensus in expected O(N log2 N) operations per processor. SIAM Journal on Computing 25(5), 1024–1044 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Attiya, H., Censor, K.: Tight bounds for asynchronous randomized consensus. Journal of the ACM 55(5), 20 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Attiya, H., Dolev, D., Shavit, N.: Bounded polynomial randomized consensus. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, August 14–16, pp. 281–293 (1989)

    Google Scholar 

  9. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd edn. John Wiley & Sons, Chichester (2004)

    Book  MATH  Google Scholar 

  10. Azuma, K.: Weighted sums of certain dependent random variables. Tôhoku Mathematical Journal 19(3), 357–367 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bracha, G., Rachman, O.: Approximated counters and randomized consensus. Technical Report 662, Technion (1990)

    Google Scholar 

  12. Bracha, G., Rachman, O.: Randomized consensus in expected O(n 2 logn) operations. In: Toueg, S., Spirakis, P.G., Kirousis, L.M. (eds.) WDAG 1991. LNCS, vol. 579, pp. 143–150. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  13. Chor, B., Israeli, A., Li, M.: Wait-free consensus using asynchronous hardware. SIAM J. Comput. 23(4), 701–712 (1994)

    Article  MathSciNet  Google Scholar 

  14. Dwork, C., Herlihy, M., Plotkin, S., Waarts, O.: Time-lapse snapshots. SIAM Journal on Computing 28(5), 1848–1874 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Grimmett, G.R., Stirzaker, D.R.: Probability and Random Processes. Oxford University Press, Oxford (2001)

    MATH  Google Scholar 

  16. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  17. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Yale University, USA

    James Aspnes

Authors
  1. James Aspnes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel

    David Peleg

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aspnes, J. (2011). Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers. In: Peleg, D. (eds) Distributed Computing. DISC 2011. Lecture Notes in Computer Science, vol 6950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24100-0_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24100-0_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24099-7

  • Online ISBN: 978-3-642-24100-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation