Skip to main content
SpringerLink
Log in

Failure Detection Lower Bounds on Registers and Consensus

Extended Abstract

  • Conference paper
  • First Online:
Distributed Computing (DISC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2508))

Included in the following conference series:

Abstract

This paper addresses the problem of determining the weakest failure detector for consensus in a message passing system when t out of n processes can crash (including when n/2 ≤ t < n - 1), by addressing the problem of determining the weakest failure detector for register problem. We complement and, in a precise sense, generalize previous results on the implementability of consensus and registers in a message passing model (augmented with the failure detector abstraction).

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. M. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Thrifty Generic Broadcast. Proceedings of the 14th International Conference, DISC 2000, Toledo, Spain. Springer Verlag (LNCS 1914), 2000.

    Google Scholar 

  2. H. Attiya and J. Welch. Distributed Computing. Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, 1998.

    Google Scholar 

  3. K. Birman and R. van Renessee. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, 1993.

    Google Scholar 

  4. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing Memory Robustly in Message Passing Systems. Journal of the ACM, 42(1), January 1995.

    Google Scholar 

  5. T. Chandra and S. Toueg. Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2), March 1996.

    Google Scholar 

  6. T. Chandra, V. Hadzilacos and S. Toueg. The Weakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4), July 1996.

    Google Scholar 

  7. C. Dwork, N. Lynch and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2), 1988.

    Google Scholar 

  8. C. Delporte-Gallet, H. Fauconnier and R. Guerraoui. A Realistic Look at Failure Detectors. Proceedings of the IEEE International Conference on Dependable Systems and Networks, Washington DC, June 2002.

    Google Scholar 

  9. C. Delporte-Gallet, H. Fauconnier and R. Guerraoui. Failure Detection Lower Bounds on Registers and Consensus. Technical Report LIAFA, (Paris 2002) and EPFL, IC/2002/030 (Lausanne 2002).

    Google Scholar 

  10. C. Fetzer. Enforcing Perfect Failure Detection. Proceedings of the IEEE International conference on Distributed Computing Systems, Phoenix, April 2001.

    Google Scholar 

  11. M. Fischer, N. Lynch and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2), 1985.

    Google Scholar 

  12. R. Guerraoui. Revisiting the Relationship Between the Atomic Commitment and Consensus Problems. Proceedings of the International Workshop on Distributed Algorithms, Springer Verlag (LNCS 972), 1995.

    Chapter  Google Scholar 

  13. R. Guerraoui and A. Schiper. Г-Accurate Failure Detectors. Proceedings of the International Workshop on Distributed Algorithms, Springer Verlag (LNCS 1151), 1996.

    Google Scholar 

  14. R. Guerraoui. On the Hardness of Failure Sensitive Agreement Problems. Information Processing Letters, 79, 2001.

    Google Scholar 

  15. V. Hadzilacos. On the Relationship Between the Atomic Commitment and Consensus Problems. Proceedings of the International Workshop on Fault-Tolerant Distributed Computing, Springer Verlag (LNCS 448), 1986.

    Google Scholar 

  16. V. Hadzilacos, and S. Toueg. A modular approach to fault-tolerant broadcasts and related problems. Technical Report TR94-1425, Cornell University, May 1994.

    Google Scholar 

  17. J. Halpern and A. Ricciardi. A Know ledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors. Proceedings of the ACM Symposium on Principles of Distributed Computing, 1999.

    Google Scholar 

  18. P. Jayanti. Wait-free Computing. Proceedings of the International Workshop on Distributed Algorithms, Springer Verlag (LNCS 972), 1995.

    Chapter  Google Scholar 

  19. L. Lamport. Concurrent Reading and Writing. Communications of the ACM, 20(11), 1977.

    Google Scholar 

  20. L. Lamport. On Interprocess Communication (parts I and II). Distributed Computing, 1, 1986.

    Google Scholar 

  21. W-K. Lo and V. Hadzilacos. Using Failure Detectors to Solve Consensus in Asynchronous Shared-Memory Systems. Proceedings of the International Workshop on Distributed Algorithms, Springer Verlag (LNCS 857), 1994.

    Chapter  Google Scholar 

  22. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.

    Google Scholar 

  23. A. Mostéfaoui and M. Raynal. k-Set Agreement with Limited Accuracy Failure Detectors. Proceedings of the ACM Symposium on Principles of Distributed Computing, 2000.

    Google Scholar 

  24. G. Neiger. Failure Detectors and the Wait-Free Hierarchy. Proceedings of the ACM Symposium on Principles of Distributed Computing, 1995.

    Google Scholar 

  25. G. Neiger and S. Toueg. Simulating Synchronized Clocks and Common Knowledge in Distributed Systems. Journal of the ACM, 40(2), April 1993.

    Google Scholar 

  26. F. Schneider. Replication Management using the State Machine Approach. Chapter in Distributed Systems, Addison-Wesley, 1993.

    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

  2. Distributed Programming Laboratory, Swiss Federal Institute of Technology in Lausanne, Switzerland

    Rachid Guerraoui

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

  3. Rachid Guerraoui
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem, 91904, Israel

    Dahlia Malkhi

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delporte-Gallet, C., Fauconnier, H., Guerraoui, R. (2002). Failure Detection Lower Bounds on Registers and Consensus. In: Malkhi, D. (eds) Distributed Computing. DISC 2002. Lecture Notes in Computer Science, vol 2508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36108-1_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-36108-1_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-36108-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation