TY - JOUR
T1 - Renaming and the weakest family of failure detectors
AU - Afek, Yehuda
AU - Kuznetsov, Petr
AU - Nir, Israel
PY - 2012/12
Y1 - 2012/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84868690252&partnerID=8YFLogxK
U2 - 10.1007/s00446-012-0177-5
DO - 10.1007/s00446-012-0177-5
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84868690252
SN - 0178-2770
VL - 25
SP - 411
EP - 425
JO - Distributed Computing
JF - Distributed Computing
IS - 6
ER -