The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit
Rachid Guerraoui, Vassos Hadzilacos, Petr Kuznetsov, Sam Toueg · SIAM Journal on Computing · 2012
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.