Guerraoui, RachidHadzilacos, VassosKuznetsov, PetrToueg, Sam2013-03-282013-03-282013-03-28201210.1137/070698877https://infoscience.epfl.ch/handle/20.500.14299/90657WOS:000312600700001We 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.asynchronous distributed computingatomic commit problemconsensusfault-tolerant algorithmsfailure detectiontext::journal::journal article::research article