000149299 001__ 149299
000149299 005__ 20190316234816.0
000149299 0247_ $$2doi$$a10.1145/1734213.1734216
000149299 02470 $$2ISI$$a000279362300003
000149299 037__ $$aARTICLE
000149299 245__ $$aTight Failure Detection Bounds on Atomic Object Implementations
000149299 269__ $$a2010
000149299 260__ $$c2010
000149299 336__ $$aJournal Articles
000149299 520__ $$aThis article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure detector for the basic register object. We then use that to determine the weakest failure detector for all popular atomic objects including test-and-set, fetch-and-add, queue, consensus and compare-and-swap, which we show is the same.
000149299 6531_ $$aalgorithms
000149299 6531_ $$atheory
000149299 6531_ $$areliability
000149299 700__ $$aDelporte-Gallet, Carole
000149299 700__ $$aFauconnier, Hugues
000149299 700__ $$g105326$$aGuerraoui, Rachid$$0240335
000149299 773__ $$j57$$tJournal of the ACM$$k4$$q21
000149299 8564_ $$uhttps://infoscience.epfl.ch/record/149299/files/p1-Gallet.pdf$$zn/a$$s598097$$yPublisher's version
000149299 909C0 $$xU10407$$0252114$$pDCL
000149299 909CO $$ooai:infoscience.tind.io:149299$$qGLOBAL_SET$$pIC$$particle
000149299 917Z8 $$x166927
000149299 937__ $$aEPFL-ARTICLE-149299
000149299 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000149299 980__ $$aARTICLE