000125897 001__ 125897
000125897 005__ 20190812205232.0
000125897 037__ $$aCONF
000125897 245__ $$aThe Weakest Failure Detector for Message Passing Set-Agreement
000125897 269__ $$a2008
000125897 260__ $$c2008
000125897 336__ $$aConference Papers
000125897 520__ $$aIn the set-agreement problem, n processes seek to agree on at most n−1 different values. This paper determines the weakest failure detector to solve this problem in a message-passing system where processes may fail by crashing. This failure detector, called the Loneliness detector and denoted L, outputs one of two values, “true” or “false” such that: (1) there is at least one process where L outputs always “false”, and (2) if only one process is correct, L eventually outputs “true” at this process.
000125897 700__ $$aDelporte-Gallet, Carole
000125897 700__ $$aFauconnier, Hugues
000125897 700__ $$0240335$$g105326$$aGuerraoui, Rachid
000125897 700__ $$aTielmann, Andreas
000125897 7112_ $$dSeptember 22-24, 2008$$cArcachon, France$$aDISC 2008
000125897 773__ $$tProceedings of the 22nd International Symposium on Distributed Computing
000125897 8564_ $$zn/a$$uhttps://infoscience.epfl.ch/record/125897/files/52180109.pdf$$s188561
000125897 909C0 $$xU10407$$pDCL$$0252114
000125897 909CO $$ooai:infoscience.tind.io:125897$$qGLOBAL_SET$$pconf$$pIC
000125897 937__ $$aLPD-CONF-2008-029
000125897 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000125897 980__ $$aCONF