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 , 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 prove that the primary-partition group membership problem cannot be solved in asynchronous systems with crash failures, even if one allows the removal or killing of non-faulty processes that are erroneously suspected to have crashed.
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)
Reliable concurrent processing of transactions in a database system is examined. Since serializability, the conventional concurrency control correctness criterion, is not adequate in the presence of common failures, another theory of correctness is proposed, involving the concepts of <italic>commit serializability, recoverability,</italic> and… (More)
1 INTRODUCTION Recently a new theory of dlsmbuted computing has been proposed , accordmg to which a dlsmbuted computation 1s vIewed as an activity of knowledge acqulsmon and chssemmatlon by commumcatmg processes (Halpem and Moses [ 19861, Halpem and Fagm ) In addmon to supplymg a formal log& foundation for &smbuted computmg which directly supports the… (More)