- Full text PDF available (49)
- This year (1)
- Last 5 years (9)
- Last 10 years (15)
Addison-Wesley, Reading. Hardcover in fine condition. Binding is secure, cover and spine are clean with minimal Finally I can be normally changed, only by any transaction must. Ss2pl or not co is, an intentional abort. In such as a well follows the following rules and has started. If selection and an obvious overhead versus executing programs that ss2pl.… (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 , 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)
Chandra and Toueg proposed a new approach to overcome the impossibility of reaching consensus in asynchronous message-passing systems subject to crash failures 6]. They augment the asynchronous message-passing system with a (possibly unreliable) failure detector. Informally , a failure detector provides some information about the processes that have crashed… (More)
The principle of atomic commitment ordering, or guaranteeing serializability in a heterogeneous environment of multiple autonomous resource managers using atomic commitment.
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)
We investigate the problem of reaching Byzantine Agreement in arbitrary networks where both processors and communication links are subject to omission or stopping faults. For the case of deterministic, synchronous algorithms we give a necessary and sufficient condition relating the solvability of the problem to the connectivity of the network. 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)
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)