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

Failure detectors in loosely named systems

Published: 18 August 2008 Publication History

Abstract

This paper explores the power of failure detectors in read write shared memory systems with n processes whose names are drawn from the set {1...m}, m>=2n-1. We do so by making an additional assumption, name obliviousness, on top of the three failure detector assumptions introduced by ZieliDski. We present name non-oblivious failure detectors that are strong enough to wait-free solve the Symmetry Breaking (SB) problem, but not enough to solve the (n-1)-Set Consensus problem. Furthermore a family of weakest such failure detectors is presented. On the other hand we show that any non trivial name oblivious failure detector can wait-free solve (n-1)-Set Consensus, by introducing a simple extension to anti-Omega, the Loose-anti-Omega failure detector, and proving that it is the weakest failure detector that conforms to the four assumptions above.

References

[1]
Borowsky E., Gafni E., Generalized FLP impossibility result for t-resilient asynchronous computations. In Proceedings of the 1993 ACM Symposium on Theory of Computing, 206--215, May 1993.
[2]
Chandra T.D., Hadzilacos V., Toueg S., The weakest failure detector for solving consensus. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, 685 - 722, 1996.
[3]
Chandra T.D., Toueg S., Unreliable failure detectors for reliable distributed systems. In Journal of the ACM, 43(2):225-267, 1996.
[4]
Chaudhuri S., Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In Proceedings Of The 9th Annual ACM Symposium On Principles of Distributed Computing, 311--234, August 1990.
[5]
Chen W., Chen Y., Zhang J., On failure detectors weaker than ever. Technical Report MSR-TR-2007-50, Microsoft Research, may 2007.
[6]
Gafni E., Rajsbaum S., Herlihy M., Subconsensus tasks: Renaming is weaker than set agreement. In Dolev S., editor, DISC, volume 4167 of Lecture Notes in Computer Science, 329--338. Springer, 2006.
[7]
Gordon D.M., Kuperberg G., Patashnik O., New constructions for covering designs. In J. Combin. Designs 3, 269-284, 1995.
[8]
Guerraoui R., Herlihy M., Kouznetsov P., Lynch N., Newport C., On the weakest failure detector ever. In proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, 235 - 243, 2007.
[9]
Herlihy M.P., Shavit N., The Topological Structure of Asynchronous Computability. In Journal of the ACM, 46(6):858-923, 1999.
[10]
Lo W., Hadzilacos V., Using Failure Detectors to Solve Consensus in Asynchronous Shared-Memory Systems. In Proceedings of the 8th International Workshop on Distributed Algorithms, pages 280--295, Terschelling, The Netherlands, 1994.
[11]
Saks M. and Zaharoglou F., Wait-free k-set agreement is impossible: The topology of public knowledge. In Proceedings of the 25th ACM Symposium on Theory of Computing, 101--110, May 1993.
[12]
Schönheim J., On coverings. Pacific Journal of Mathematics, 1405--1411, 1964.
[13]
Yang J., Neiger G., Gafni E., Structured derivations of consensus algorithms for failure detectors. In Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, 297--306, 1998.
[14]
Zielinski, P. Automatic Classification of Eventual Failure Detectors. In Proceedings of the 21st International Symposium on Distributed Computing (DISC), Andrzej Pelc, editor, volume 4731 of Lecture Notes on Computer Science, 465-479. Springer 2007.
[15]
Zielinski P. anti-Omega: The Weakest Failure Detector for Set Agreement. In proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, August 2008, Toronto Canada.

Cited By

View all
  • (2012)Wait-freedom with adviceProceedings of the 2012 ACM symposium on Principles of distributed computing10.1145/2332432.2332456(105-114)Online publication date: 16-Jul-2012
  • (2012)Renaming and the weakest family of failure detectorsDistributed Computing10.1007/s00446-012-0177-525:6(411-425)Online publication date: 2-Sep-2012
  • (2011)Brief announcementProceedings of the 25th international conference on Distributed computing10.5555/2075029.2075045(145-146)Online publication date: 20-Sep-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. anti-omega
  2. failure detectors
  3. loosely named systems
  4. set consensus
  5. symmetry breaking
  6. wait-free

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

Other Metrics

Citations

Cited By

View all
  • (2012)Wait-freedom with adviceProceedings of the 2012 ACM symposium on Principles of distributed computing10.1145/2332432.2332456(105-114)Online publication date: 16-Jul-2012
  • (2012)Renaming and the weakest family of failure detectorsDistributed Computing10.1007/s00446-012-0177-525:6(411-425)Online publication date: 2-Sep-2012
  • (2011)Brief announcementProceedings of the 25th international conference on Distributed computing10.5555/2075029.2075045(145-146)Online publication date: 20-Sep-2011
  • (2011)The failure detector abstractionACM Computing Surveys10.1145/1883612.188361643:2(1-40)Online publication date: 4-Feb-2011
  • (2010)Anti-ΩDistributed Computing10.1007/s00446-010-0101-922:5-6(335-348)Online publication date: 1-Aug-2010

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