iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-540-49823-0_45
Brief Announcement: Chasing the Weakest System Model for Implementing $\it \Omega$ and Consensus | SpringerLink
Skip to main content

Brief Announcement: Chasing the Weakest System Model for Implementing \(\it \Omega\) and Consensus

  • Conference paper
Stabilization, Safety, and Security of Distributed Systems (SSS 2006)

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

Included in the following conference series:

Abstract

The chase for the weakest system model that allows to solve consensus has long been an active branch of research in distributed algorithms. To circumvent the FLP impossibility in asynchronous systems, many models in between synchrony and asynchrony have been proposed over the years. Of specific interest is the chase for the weakest system model that allows the implementation of an eventual leader oracle Ω, and thus also enables consensus to be solved.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Similar content being viewed by others

References

  1. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: Proc. PODC 2004, pp. 328–337. ACM Press, New York (2004)

    Chapter  Google Scholar 

  2. Malkhi, D., Oprea, F., Zhou, L.: Ω meets paxos: Leader election and stability without eventual timely links. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 199–213. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Hutle, M., Malkhi, D., Schmid, U., Zhou, L.: Chasing the weakest system model for implementing omega and consensus. Research Report 74/2005, Technische Universität Wien, Institut für Technische Informatik, Treitlstr. 1-3/182-2, 1040 Vienna, Austria (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hutle, M., Malkhi, D., Schmid, U., Zhou, L. (2006). Brief Announcement: Chasing the Weakest System Model for Implementing \(\it \Omega\) and Consensus. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49823-0_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49018-0

  • Online ISBN: 978-3-540-49823-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics