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.


    • LPD-REPORT-2006-003

    Record created on 2006-03-17, modified on 2017-05-12

Related material