Skip to main content
SpringerLink
Log in

With Finite Memory Consensus Is Easier Than Reliable Broadcast

  • Conference paper
Principles of Distributed Systems (OPODIS 2008)

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

Included in the following conference series:

Abstract

We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus and reliable broadcast. With finite process memory, we show that in some sense consensus is easier to solve than reliable broadcast, and that reliable broadcast is as difficult to solve as repeated consensus: More precisely, with finite memory, consensus can be solved with failure detector \(\cal S\), and \({\cal P}^-\) (a variant of the perfect failure detector which is stronger than \(\cal S\)) is necessary and sufficient to solve reliable broadcast and repeated consensus.

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. Guerraoui, R., Schiper, A.: The generic consensus service. IEEE Transactions on Software Engineering 27(1), 29–41 (2001)

    Article  Google Scholar 

  2. Gafni, E., Lamport, L.: Disk paxos. Distributed Computing 16(1), 1–20 (2003)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Chor, B., Coan, B.A.: A simple and efficient randomized byzantine agreement algorithm. IEEE Trans. Software Eng. 11(6), 531–539 (1985)

    Article  MathSciNet  Google Scholar 

  5. Dolev, D., Dwork, C., Stockmeyer, L.J.: On the minimal synchronism needed for distributed consensus. Journal of the ACM 34(1), 77–97 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288–323 (1988)

    Article  MathSciNet  Google Scholar 

  7. 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 

  8. 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 

  9. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Shared memory vs message passing. Technical report, LPD-REPORT-2003-001 (2003)

    Google Scholar 

  10. Eisler, J., Hadzilacos, V., Toueg, S.: The weakest failure detector to solve nonuniform consensus. Distributed Computing 19(4), 335–359 (2007)

    Article  MATH  Google Scholar 

  11. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Kouznetsov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: Twenty-Third Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 338–346 (2004)

    Google Scholar 

  12. Aguilera, M.K., Toueg, S., Deianov, B.: Revisiting the weakest failure detector for uniform reliable broadcast. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 13–33. Springer, Heidelberg (1999)

    Google Scholar 

  13. Halpern, J.Y., Ricciardi, A.: A knowledge-theoretic analysis of uniform distributed coordination and failure detectors. In: Eighteenth Annual ACM Symposium on Principles of Distributed Computing (PODC 1999), pp. 73–82 (1999)

    Google Scholar 

  14. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kouznetsov, P.: Mutual exclusion in asynchronous systems with failure detectors. Journal of Parallel and Distributed Computing 65(4), 492–505 (2005)

    Article  MATH  Google Scholar 

  15. Guerraoui, R., Kapalka, M., Kouznetsov, P.: The weakest failure detectors to boost obstruction-freedom. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 399–412. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Raynal, M., Travers, C.: In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 3–19. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Zielinski, P.: Anti-omega: the weakest failure detector for set agreement. Technical Report UCAM-CL-TR-694, Computer Laboratory, University of Cambridge, Cambridge, UK (July 2007)

    Google Scholar 

  18. Lynch, N.A., Mansour, Y., Fekete, A.: Data link layer: Two impossibility results. In: Symposium on Principles of Distributed Computing, pp. 149–170 (1988)

    Google Scholar 

  19. Bazzi, R.A., Neiger, G.: Simulating crash failures with many faulty processors (extended abstract). In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 166–184. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  20. Delporte-Gallet, C., Devismes, S., Fauconnier, H., Petit, F., Toueg, S.: With finite memory consensus is easier than reliable broadcast. Technical Report hal-00325470, HAL (October 2008)

    Google Scholar 

  21. Cavin, D., Sasson, Y., Schiper, A.: Consensus with unknown participants or fundamental self-organization. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2004. LNCS, vol. 3158, pp. 135–148. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  22. Greve, F., Tixeuil, S.: Knowledge connectivity vs. synchrony requirements for fault-tolerant agreement in unknown networks. In: DSN, pp. 82–91. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  23. Fernández, A., Jiménez, E., Raynal, M.: Eventual leader election with weak assumptions on initial knowledge, communication reliability, and synchrony. In: DSN, pp. 166–178. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  24. Chandra, T.D., Toueg, S.: Unreliable failure detectors for asynchronous systems (preliminary version). In: 10th Annual ACM Symposium on Principles of Distributed Computing (PODC 1991), pp. 325–340 (1991)

    Google Scholar 

  25. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: A realistic look at failure detectors. In: DSN, pp. 345–353. IEEE Computer Society, Los Alamitos (2002)

    Google Scholar 

  26. Hadzilacos, V., Toueg, S.: A modular approach to fault-tolerant broadcasts and related problems. Technical Report TR 94-1425, Department of Computer Science, Cornell University (1994)

    Google Scholar 

  27. Bartlett, K.A., Scantlebury, R.A., Wilkinson, P.T.: A note on reliable full-duplex transmission over halfduplex links. Journal of the ACM 12, 260–261 (1969)

    Article  Google Scholar 

  28. Stenning, V.: A data transfer protocol. Computer Networks 1, 99–110 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université D. Diderot, Paris, France

    Carole Delporte-Gallet & Hugues Fauconnier

  2. VERIMAG, Université Joseph Fourier, Grenoble, France

    Stéphane Devismes

  3. INRIA/LIP Laboratory, Univ. of Lyon/ENS Lyon, Lyon, France

    Franck Petit

  4. Department of Computer Science, University of Toronto, Toronto, Canada

    Sam Toueg

Authors
  1. Carole Delporte-Gallet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stéphane Devismes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hugues Fauconnier
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Franck Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sam Toueg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Florida State University, 207A Love Building, PO Box 4530, FL 32306-4530, Tallahassee, USA

    Theodore P. Baker

  2. Université de Versailles-St-Quentin-en-Yvelines, 45, avenue des Etats-Unis, 78035, Versailles Cedex, France

    Alain Bui

  3. LIP6 & INRIA Grand Large, Université Pierre et Marie Curie - Paris 6, 104 avenue du Président Kennedy, 75016, Paris, France

    Sébastien Tixeuil

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delporte-Gallet, C., Devismes, S., Fauconnier, H., Petit, F., Toueg, S. (2008). With Finite Memory Consensus Is Easier Than Reliable Broadcast . In: Baker, T.P., Bui, A., Tixeuil, S. (eds) Principles of Distributed Systems. OPODIS 2008. Lecture Notes in Computer Science, vol 5401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92221-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92221-6_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92220-9

  • Online ISBN: 978-3-540-92221-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation