Skip to main content
SpringerLink
Log in

Two Consensus Algorithms with Atomic Registers and Failure Detector Ω

  • Conference paper
Distributed Computing and Networking (ICDCN 2009)

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

Included in the following conference series:

Abstract

We present here two consensus algorithms in shared memory asynchronous systems with the eventual leader election failure detector Ω. In both algorithms eventually only the leader given by failure detector Ω will progress, and being eventually alone to make steps the leader will decide. The first algorithm uses an infinite number of multi-writer multi-reader atomic registers and works with an unbounded number of anonymous processes. The second uses only a finite number of single-writer multi-reader registers but assumes a finite number of processes with known unique identities.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374–382 (1985)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

  3. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM 43(4), 685–722 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lo, W.K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared memory systems. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 280–295. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  6. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Koutnetzov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: 23th ACM Symposium on Principles of Distributed Computing (2004)

    Google Scholar 

  7. Koutnetzov, P.: Synchronisation using failure detector. Technical report, PhD Thesis, EPFL (2005)

    Google Scholar 

  8. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing 0mega with weak reliability and synchrony assumptions. In: 22th ACM Symposium on Principles of Distributed Computing, pp. 306–314 (2003)

    Google Scholar 

  9. Malkhi, D., Oprea, F., Zhou, L.: Omega 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 

  10. Lamport, L.: The Part-Time parliament. ACM Transactions on Computer Systems 16(2), 133–169 (1998)

    Article  Google Scholar 

  11. Gafni, E., Lamport, L.: Disk paxos. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 330–344. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. Distributed Computing 18(1), 73–84 (2005)

    Article  MATH  Google Scholar 

  13. Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Deconstructing paxos. Distributed Computing Column of ACM SIGACT News 34(1) (2003)

    Google Scholar 

  14. Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Reconstructing paxos. Distributed Computing Column of ACM SIGACT News 34(2) (2003)

    Google Scholar 

  15. Guerraoui, R., Raynal, M.: The alpha of indulgent consensus. Comput. J. 50(1), 53–67 (2007)

    Article  Google Scholar 

  16. Mostéfaoui, A., Raynal, M.: Leader-based consensus. Parallel Processing Letters 11(1), 95–107 (2001)

    Article  MathSciNet  Google Scholar 

  17. Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: 23rd International Conference on Distributed Computing Systems (ICDCS), Providence, RI, USA (2003)

    Google Scholar 

  18. Chor, B., Israeli, A., Li, M.: On processor coordination using asynchronous hardware. In: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, pp. 222–231 (1987)

    Google Scholar 

  19. Abrahamson, K.: On achieving consensus using a shared memory. In: PODC 1988: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, pp. 291–302. ACM Press, New York (1988)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing, pp. 27–30 (1983)

    Google Scholar 

  22. Herlihy, M., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463–492 (1990)

    Article  Google Scholar 

  23. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)

    MATH  Google Scholar 

  24. Mostéfaoui, A., Raynal, M., Tronel, F.: From binary consensus to multivalued consensus in asynchronous message-passing systems. Inf. Process. Lett. 73(5-6), 207–212 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Algorithmique: Fondements et Applications, Université Paris VII - Denis Diderot, France

    Carole Delporte-Gallet & Hugues Fauconnier

Authors
  1. Carole Delporte-Gallet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hugues Fauconnier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM India Research Laboratory, 110070, New Delhi, India

    Vijay Garg

  2. ETH Zurich, 8092, Zurich, Switzerland

    Roger Wattenhofer

  3. International Institute of Information Technology, 500032, Hyderabad, India

    Kishore Kothapalli

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delporte-Gallet, C., Fauconnier, H. (2008). Two Consensus Algorithms with Atomic Registers and Failure Detector Ω . In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92295-7_31

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-92295-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation