Failure detectors in loosely named systems

Yehuda Afek, Israel Nir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 Zieliński. 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-Ω;, the Loose-anti-Ω failure detector, and proving that it is the weakest failure detector that conforms to the four assumptions above.

Original languageEnglish
Title of host publicationPODC'08
Subtitle of host publicationProceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages65-74
Number of pages10
ISBN (Print)9781595939890
DOIs
StatePublished - 2008
Event27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - Toronto, ON, Canada
Duration: 18 Aug 200821 Aug 2008

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
Country/TerritoryCanada
CityToronto, ON
Period18/08/0821/08/08

Keywords

  • Anti-omega
  • Failure detectors
  • Loosely named systems
  • Set consensus
  • Symmetry breaking
  • Wait-free

Fingerprint

Dive into the research topics of 'Failure detectors in loosely named systems'. Together they form a unique fingerprint.

Cite this