Renaming and the weakest family of failure detectors

Yehuda Afek*, Petr Kuznetsov, Israel Nir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We address the question of the weakest failure detector to circumvent the impossibility of (2n-2) -renaming in a system of up to n participating processes. We derive that in a restricted class of eventual failure detectors there does not exist a single weakest oracle, but a weakest family of oracles ζ n: every two oracles in ζ n are incomparable, and every oracle that allows for solving renaming provides at least as much information about failures as one of the oracles in ζ n. As a by product, we obtain one more evidence that renaming is strictly easier to solve than set agreement.

Original languageEnglish
Pages (from-to)411-425
Number of pages15
JournalDistributed Computing
Issue number6
StatePublished - Dec 2012


Dive into the research topics of 'Renaming and the weakest family of failure detectors'. Together they form a unique fingerprint.

Cite this