Home > On The Weakest Failure Detector Ever > HTML MARC |

000109295 001__ 109295 000109295 005__ 20190812205103.0 000109295 02470 $$2ISI$$a000266108700025 000109295 037__ $$aCONF 000109295 245__ $$aOn The Weakest Failure Detector Ever 000109295 269__ $$a2007 000109295 260__ $$c2007 000109295 336__ $$aConference Papers 000109295 520__ $$aMany problems in distributed computing are impossible when no information about process failures is available. So what is the minimal yet non-trivial failure information? In other words, what is the minimal information about failures needed to circumvent any impossibility and sufficient to circumvent some impossibility. This paper proposes a candidate abstraction, denoted ?, to capture this failure information. In every run of the distributed system, ? eventually informs the processes that some set of processes in the system cannot be the set of correct processes in that run. Although seemingly weak, for it might provide random information for an arbitrarily long period of time, and it only excludes one possibility of correct set among many, ? still captures non-trivial failure information. We show that ? is sufficient to circumvent the celebrated wait-free set-agreement impossibility. While doing so, we (a) disprove previous conjectures about the weakest failure detector to solve set-agreement and we (b) prove that solving set-agreement with registers is strictly weaker than solving n + 1-process consensus using n-process consensus. We prove that ? is, in some sense, necessary to circumvent any wait-free impossibility. As a corollary, set-agreement is, from a failure information perspective, a minimal wait-free impossible problem in distributed computing. Our results are generalized through an abstraction ?f that we introduce and prove necessary to solve any problem that cannot be solved in an f -resilient manner, and yet sufficient to solve f -resilient f -set-agreement. 000109295 700__ $$0240335$$g105326$$aGuerraoui, Rachid 000109295 700__ $$aHerlihy, Maurice 000109295 700__ $$0241770$$g128437$$aKouznetsov, Petr 000109295 700__ $$aLynch, Nancy 000109295 700__ $$aNewport, Calvin 000109295 7112_ $$dAugust, 12-15 2007$$cPortland, Oregon, USA$$a26th ACM Symposium on Principles of Distributed Computing (PODC'07) 000109295 773__ $$tProceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC'07) 000109295 909C0 $$xU10407$$pDCL$$0252114 000109295 909CO $$pconf$$pIC$$ooai:infoscience.tind.io:109295 000109295 937__ $$aLPD-CONF-2007-011 000109295 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL 000109295 980__ $$aCONF