Learn More
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [1996], it is shown that <italic>W</italic>, a failure detector that provides surprisingly little information about which processes have crashed, is sufficient to solve Consensus in(More)
We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for <i>all</i> 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(More)