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

Anti-Ω: the weakest failure detector for set agreement

Published: 18 August 2008 Publication History

Abstract

In the set agreement problem, n processes have to decide on at most n-1 of the proposed values. This paper shows that the anti-Omega failure detector is both sufficient and necessary to solve set agreement in an asynchronous shared-memory system. Each query to anti-Omega returns a single process id; the specification ensures that there is a correct process whose id is returned only finitely many times.

References

[1]
Y. Afek, E. Gafni, S. Rajsbaum, M. Raynal, and C. Travers. Simultaneous consensus tasks: A tighter characterization of set-consensus. In ICDCN 2006, LNCS 4308, pages 331--341. Springer, 2006.
[2]
Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive atomic snapshot and immediate snapshot. In PODC 2000, pages 71--80, New York, July 2000. ACM Press.
[3]
H. Attiya. A direct lower bound for k-set consensus. In PODC 1998, page 314, Puerto Vallarta, Mexico, 1998.
[4]
E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proc. of the 25th Annual ACM Symposium on the Theory of Computing, pages 91--100, San Diego, CA, USA, May 1993. ACM Press.
[5]
E. Borowsky and E. Gafni. Immediate atomic snapshots and fast renaming. In PODC 1993, pages 41--51, New York, 1993.
[6]
T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving Consensus. Journal of the ACM, 43(4):685--722, 1996.
[7]
S. Chaudhuri. More choices allow more faults: Set Consensus problems in totally asynchronous systems. INFCTRL: Information and Computation, 105, 1993.
[8]
W. Chen, Y. Chen, and J. Zhang. On failure detectors weaker than ever. Technical Report MSR-TR-2007-50, Microsoft Research, May 2007.
[9]
M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed Consensus with one faulty process. Journal of the ACM, 32(2):374--382, April 1985.
[10]
E. Gafni and L. Lamport. Disk Paxos. In DISC 2000, pages 330--344, Toledo, Spain, 2000.
[11]
E. Gafni, S. Rajsbaum, and M. Herlihy. Subconsensus tasks: Renaming is weaker than set agreement. In DISC 2006, LNCS 4167, pages 329--338. Springer, 2006.
[12]
R. Guerraoui, M. Herlihy, P. Kouznetsov, N. Lynch, and C. Newport. On the weakest failure detector ever. In PODC 2007, Portland, OR, USA, August 2007.
[13]
R. Guerraoui. Indulgent algorithms. In PODC 2000, pages 289--298, New York, July 2000. ACM Press.
[14]
R. Guerraoui and P. Kouznetsov. Finally the weakest failure detector for Non-Blocking Atomic Commit. Technical Report LPD-2003-005, EPFL, Lausanne, Switzerland, December 2003.
[15]
R. Guerraoui and M. Raynal. The Alpha of indulgent Consensus. Comput. J, 50(1):53--67, 2007.
[16]
M. Herlihy and N. Shavit. The topological structure of asynchronous computability. JACM: Journal of the ACM, 46, 1999.
[17]
W. Lo and V. Hadzilacos. Using failure detectors to solve consensus in asynchronous shared-memory systems. In WDAG 1994, LNCS 857, pages 280--295, Terschelling, The Netherlands, 1994. Springer.
[18]
M. Raynal and C. Travers. In search of the holy grail Looking for the weakest failure detector for wait-free set agreement. In OPODIS 2006, LNCS 4305, pages 3--19, Bordeaux, France, December 2006. Springer.
[19]
M. E. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. SICOMP: SIAM Journal on Computing, 29, 2000.
[20]
Piotr Zielinski. Automatic classification of eventual failure detectors. In DISC 2007, Lemesos, Cyprus, September 2007.

Cited By

View all
  • (2017)Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2016.260882928:5(1484-1499)Online publication date: 1-May-2017
  • (2013)Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement ProblemsStructural Information and Communication Complexity10.1007/978-3-319-03578-9_25(298-309)Online publication date: 2013
  • (2011)The failure detector abstractionACM Computing Surveys10.1145/1883612.188361643:2(1-40)Online publication date: 4-Feb-2011
  • 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. failure detectors
  2. set agreement
  3. wait-free impossibilities
  4. weakest failure detector ever

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)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2016.260882928:5(1484-1499)Online publication date: 1-May-2017
  • (2013)Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement ProblemsStructural Information and Communication Complexity10.1007/978-3-319-03578-9_25(298-309)Online publication date: 2013
  • (2011)The failure detector abstractionACM Computing Surveys10.1145/1883612.188361643:2(1-40)Online publication date: 4-Feb-2011
  • (2010)Turning adversaries into friendsProceedings of the 14th international conference on Principles of distributed systems10.5555/1940234.1940272(380-394)Online publication date: 14-Dec-2010
  • (2010)Distributed programming with tasksProceedings of the 14th international conference on Principles of distributed systems10.5555/1940234.1940258(205-218)Online publication date: 14-Dec-2010
  • (2010)(anti-Ωx × Σz)-based k-set agreement algorithmsProceedings of the 14th international conference on Principles of distributed systems10.5555/1940234.1940256(189-204)Online publication date: 14-Dec-2010
  • (2010)The k-simultaneous consensus problemDistributed Computing10.1007/s00446-009-0090-822:3(185-195)Online publication date: 1-Mar-2010
  • (2010)Turning Adversaries into Friends: Simplified, Made Constructive, and ExtendedPrinciples of Distributed Systems10.1007/978-3-642-17653-1_28(380-394)Online publication date: 2010
  • (2010)Distributed Programming with TasksPrinciples of Distributed Systems10.1007/978-3-642-17653-1_17(205-218)Online publication date: 2010
  • (2009)Brief announcementProceedings of the 28th ACM symposium on Principles of distributed computing10.1145/1582716.1582770(290-291)Online publication date: 10-Aug-2009
  • 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