The Weakest Failure Detectors To Solve Quittable Consensus And Nonblocking Atomic Commit

We define quittable consensus, a natural variation of the consensus problem, where processes have the option to agree on "quit" if failures occur, and we relate this problem to the well-known problem of nonblocking atomic commit. We then determine the weakest failure detectors for these two problems in all environments, regardless of the number of faulty processes.


Publié dans:
Siam Journal On Computing, 41, 6, 1343-1379
Année
2012
Publisher:
Philadelphia, Society for Industrial and Applied Mathematics
ISSN:
0097-5397
Mots-clefs:
Laboratoires:


Note: Le statut de ce fichier est:


 Notice créée le 2013-03-28, modifiée le 2019-12-05

Preprint:
Télécharger le document
PDF

Évaluer ce document:

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