The weakest failure detectors to solve
certain fundamental problems in distributed computing
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos,
Petr Kouznetzov and Sam Toueg
We determine the weakest failure detectors to solve
several fundamental problems in distributed message-passing systems,
for \emph{all} environments ---
i.e., regardless of the number and timing of crashes.
The problems that we consider are:
implementing an atomic register,
solving consensus,
solving quittable consensus (a variant of consensus in which
processes have the option to decide `quit' if a failure occurs),
and solving non-blocking atomic commit.