Tight Failure Detection Bounds on Atomic Object Implementations

This 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.


Publié dans:
Journal of the ACM, 57, 4, 21
Année
2010
Mots-clefs:
Laboratoires:




 Notice créée le 2010-06-11, modifiée le 2019-03-16

Publisher's version:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)