skip to main content
10.1145/1400751.1400763acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
research-article

Every problem has a weakest failure detector

Published: 18 August 2008 Publication History

Abstract

Several basic problems that arise in fault-tolerant distributed computing were shown to have a weakest failure detector. We show here that every problem that is solvable with a failure detector has a weakest failure detector.

References

[1]
Marcos K. Aguilera, Sam Toueg, and Boris Deianov. Revisiting the weakest failure detector for uniform reliable broadcast. In DISC '99: Proceedings of the thirteenth International Symposium on Distributed Computing, pages 13--33, LNCS vol. 1693. Springer-Verlag, September 1999.
[2]
Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.
[3]
Michael Ben-Or. Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In PODC '83: Proceedings of the second annual ACM symposium on Principles of distributed computing, pages 27--30. ACM Press, August 1983.
[4]
Tushar D. Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685--722, July 1996.
[5]
Tushar D. Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225--267, March 1996.
[6]
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, and Sam Toueg. 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, pages 338--346. ACM Press, July 2004.
[7]
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, and Petr Kouznetsov. Mutual exclusion in asynchronous systems with failure detectors. Journal of Parallel and Distributed Computing, 65(4):492--505, April 2005.
[8]
Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77--97, January 1987.
[9]
Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288--323, April 1988.
[10]
Rachid Guerraoui, Michal Kapalka, and Petr Kouznetsov. The weakest failure detectors to boost obstruction-freedom. In DISC '06: Proceedings of the twentieth International Symposium on Distributed Computing, pages 399--412, LNCS vol. 4167. Springer-Verlag, September 2006.
[11]
Joseph Y. Halpern and Aleta Ricciardi. A knowledge-theoretic analysis of uniform distributed coordination and failure detectors. In PODC '99: Proceedings of the eighteenth annual ACM symposium on Principles of Distributed Computing, pages 73--82. ACM Press, May 1999.
[12]
Maurice P. Herlihy and Jeannette M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3):463--492, July 1990.
[13]
Piotr Zielinski. Anti-omega: the weakest failure detector for set agreement. Technical Report UCAM-CL-TR-694, Computer Laboratory, University of Cambridge, Cambridge, UK, July 2007.

Cited By

View all
  • (2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks10.1016/j.comnet.2024.110432247(110432)Online publication date: Jun-2024
  • (2020)Perfect failure detection with very few bitsInformation and Computation10.1016/j.ic.2020.104604(104604)Online publication date: Jul-2020
  • (2018)On the Strongest Message Adversary for Consensus in Directed Dynamic NetworksStructural Information and Communication Complexity10.1007/978-3-030-01325-7_13(102-120)Online publication date: 31-Oct-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
August 2008
474 pages
ISBN:9781595939890
DOI:10.1145/1400751
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 August 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. asynchronous system
  2. failure detector
  3. fault-tolerance

Qualifiers

  • Research-article

Conference

PODC '08

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)12
  • Downloads (Last 6 weeks)1
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks10.1016/j.comnet.2024.110432247(110432)Online publication date: Jun-2024
  • (2020)Perfect failure detection with very few bitsInformation and Computation10.1016/j.ic.2020.104604(104604)Online publication date: Jul-2020
  • (2018)On the Strongest Message Adversary for Consensus in Directed Dynamic NetworksStructural Information and Communication Complexity10.1007/978-3-030-01325-7_13(102-120)Online publication date: 31-Oct-2018
  • (2017)The weakest failure detector for eventual consistencyDistributed Computing10.1007/s00446-016-0292-932:6(479-492)Online publication date: 5-Jan-2017
  • (2016)Perfect Failure Detection with Very Few BitsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-319-49259-9_13(154-169)Online publication date: 3-Nov-2016
  • (2015)The Weakest Failure Detector for Eventual ConsistencyProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767404(375-384)Online publication date: 21-Jul-2015
  • (2015)Wait-freedom with adviceDistributed Computing10.1007/s00446-014-0231-628:1(3-19)Online publication date: 1-Feb-2015
  • (2014)The Generalized Loneliness Detector and Weak System Models for k-Set AgreementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2013.7725:4(1078-1088)Online publication date: 1-Apr-2014
  • (2014)Solvability-Based Comparison of Failure DetectorsProceedings of the 2014 IEEE 13th International Symposium on Network Computing and Applications10.1109/NCA.2014.46(269-276)Online publication date: 21-Aug-2014
  • (2014)What Can be Computed in a Distributed System?From Programs to Systems. The Systems perspective in Computing10.1007/978-3-642-54848-2_14(209-224)Online publication date: 2014
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media