000089675 001__ 89675
000089675 005__ 20190316233825.0
000089675 037__ $$aCONF
000089675 245__ $$aThe Weakest Failure Detectors to Boost Obstruction-Freedom
000089675 269__ $$a2006
000089675 260__ $$c2006
000089675 336__ $$aConference Papers
000089675 490__ $$aLecture Notes in Computer Science$$vLNCS 4167
000089675 520__ $$aThis paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even when universal objects (like compare-and-swap) or random oracles are available, whereas the sufficient ones assume only registers. We show that failure detector <>P is the weakest to convert any obstruction-free algorithm into a wait-free one, and Omega*, a new failure detector which we introduce in this paper, and which is strictly weaker than <>P but strictly stronger than Omega, is the weakest to convert any obstruction-free algorithm into a non-blocking one.
000089675 700__ $$0240335$$g105326$$aGuerraoui, Rachid
000089675 700__ $$aKapalka, Michal
000089675 700__ $$aKouznetsov, Petr$$0241770$$g128437
000089675 7112_ $$dSeptember 2006$$cStockholm, Sweden$$a20th International Symposium on Distributed Computing (DISC'06)
000089675 773__ $$tProceedings of the 20th International Symposium on Distributed Computing (DISC'06)$$q399-412
000089675 8564_ $$uhttps://infoscience.epfl.ch/record/89675/files/of-wfnb-part1.pdf$$zn/a$$s232458
000089675 909C0 $$xU10407$$0252114$$pDCL
000089675 909CO $$ooai:infoscience.tind.io:89675$$qGLOBAL_SET$$pconf$$pIC
000089675 937__ $$aLPD-CONF-2006-041
000089675 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000089675 980__ $$aCONF