Skip to main content
SpringerLink
Log in

The minimum information about failures for solving non-local tasks in message-passing systems

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We first define the basic notions of local and non-local tasks for distributed systems. Intuitively, a task is local if, in a system with no failures, each process can compute its output value locally by applying some local function on its own input value (so the output value of each process depends only on the process’ own input value, not on the input values of the other processes); a task is nonlocal otherwise. All the interesting distributed tasks, including all those that have been investigated in the literature (e.g., consensus, set agreement, renaming, atomic commit, etc.) are non-local. In this paper we consider non-local tasks and determine the minimum information about failures that is necessary to solve such tasks in message-passing distributed systems. As part of this work, we also introduces weak set agreement—a natural weakening of set agreement—and show that, in some precise sense, it is the weakest nonlocal task in message-passing systems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aguilera, M.K., Toueg, S., Deianov, B.: Revisiting the weakest failure detector for uniform reliable broadcast. In: DISC ’99: Proceedings of the Thirteenth International Symposium on Distributed Computing, vol. 1693 of LNCS, pp. 13–33. Springer (1999)

  2. Biran O., Moran S., Zaks S.: A combinatorial characterization of the distributed 1-solvable tasks. J. Algorithms 11(3), 420–440 (1990)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Chaudhuri S.: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105(1), 132–158 (1993)

    Article  MATH  Google Scholar 

  6. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Tight failure detection bounds on atomic object implementations. J. ACM 57(4), 22:1–22:32 (2010)

    Google Scholar 

  7. 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 PODC ’04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 338–346. ACM Press (2004)

  8. Delporte-Gallet C., Fauconnier H., Guerraoui R., Kouznetsov P.: Mutual exclusion in asynchronous systems with failure detectors. J. Parallel Distrib. Comput. 65(4), 492–505 (2005)

    Article  MATH  Google Scholar 

  9. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The weakest failure detector for message passing set-agreement. In DISC ’08: Proceedings of the Twenty-Second International Symposium on Distributed Computing, vol. 5218 of LNCS, pp. 109–120. Springer (2008)

  10. Delporte-Gallet, C., Fauconnier, H., Toueg, S.: The minimum information about failures for solving non-local tasks in message-passing systems. In: OPODIS ’09: Proceedings of the Thirteenth International Conference on Principle of Distributed Systems, vol. 5923 of LNCS, pp. 115–128. Springer (2009)

  11. Fischer, M.J.: The consensus problem in unreliable distributed systems (a brief survey). In: Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory, vol. 158 of LNCS, pp. 127–140. Springer (1983)

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Guerraoui R., Herlihy M., Kuznetsov P., Lynch N.A., Newport C.C.: On the weakest failure detector ever. Distrib. Comput. 21(5), 353–366 (2009)

    Article  Google Scholar 

  14. Guerraoui R., Kapalka M., Kouznetsov P.: The weakest failure detectors to boost obstruction-freedom. Distrib. Comput. 20(6), 415–433 (2008)

    Article  Google Scholar 

  15. Hadzilacos, V.: On the relationship between the atomic commitment and consensus problems. In: Fault-Tolerant Distributed Computing, vol. 448 of LNCS, pp. 201–208. Springer (1986)

  16. Halpern J.Y., Ricciardi A.: A knowledge-theoretic analysis of uniform distributed coordination and failure detectors. Distrib. Comput. 17(3), 223–236 (2005)

    Article  Google Scholar 

  17. Herlihy M., Shavit N.: The topological structure of asynchronous computability. J. ACM 46(6), 858–923 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  18. Jayanti, P., Toueg, S.: Every problem has a weakest failure detector. In: PODC ’08: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, pp. 75–84. ACM Press (2008)

  19. Saks M.E., Zaharoglou F.: Wait-free k-set agreement is impossible: the topology of public knowledge. SIAM J. Comput. 29(5), 1449–1483 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  20. Zielinski, P.: Automatic classification of eventual failure detectors. In: DISC ’07: Proceedings of the Twenty-First International Symposium on Distributed Computing, vol. 4731 of LNCS, pp. 465–479. Springer (2007)

  21. Zielinski P.: Anti-Ω: the weakest failure detector for set agreement. Distrib. Comput. 22(5–6), 335–348 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Paris-Diderot, Paris, France

    Carole Delporte-Gallet & Hugues Fauconnier

  2. University of Toronto, Toronto, ON, Canada

    Sam Toueg

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. Sam Toueg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sam Toueg.

Additional information

An extended abstract of this work appeared in [10].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delporte-Gallet, C., Fauconnier, H. & Toueg, S. The minimum information about failures for solving non-local tasks in message-passing systems. Distrib. Comput. 24, 255–269 (2011). https://doi.org/10.1007/s00446-011-0146-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-011-0146-4

Keywords

Search

Navigation