The weakest failure detectors to solve Quittable Consensus and Non-Blocking Atomic Commit

We introduce 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 non-blocking atomic commit. We then determine the weakest failure detectors for these two problems in all environments, regardless of the number of faulty processes.


Year:
2004
Laboratories:




 Record created 2006-03-17, last modified 2018-06-22

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)