EL Abbadi, A. Skeen, and F. Christian. An Efficient, Fault-Tolerant Algorithm for Replicated Data Management. In The 5th ACM SIGACT-SIGMOD Symposium on the Principles of Database Systems, pages 215--229, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Mobile Computing in Military Ambulatory Care - Bukhres, Morton (1997) (2 citations) (Correct)
....site perform the entire transaction on its local copy, so that the sites can work asynchronously and are not blocked while waiting for computed results from one site. This is especially important in a mobile environment where wireless connection times are expensive. The Available Copies Algorithm [1] follows the intuitive of read one write all. A data item can be read and written within a partition only if a majority of copies are available within that partition. This algorithm only works if partition failures are clean and sites can detect partition failures instantaneously. This algorithm ....
EL Abbadi, A. Skeen, and F. Christian. An Efficient, Fault-Tolerant Algorithm for Replicated Data Management. In The 5th ACM SIGACT-SIGMOD Symposium on the Principles of Database Systems, pages 215--229, 1985.
Voting and Relocation Strategies Preserving Consistency among.. - Borghoff (Correct)
.... methods that allow for dynamic changes of the degree of replication as well as for dynamic changes of the location of replicas [21, 26, 27, 30] Our method prevents inconsistencies in the presence of communication link failures such as partitions where an available copy replication method [1, 25] is unsuited. Every data block k 2 K t (d) is individually accessed. To simplify our replication method, we assume a majority consensus voting approach [45] Before accessing a data block k of a file d, a quorum must be collected. All nodes r for which AC t (d; r) 6= 0 are asked to vote in case of ....
A. El Abbadi, D. Skeen, and F. Christian. An efficient, fault-tolerant algorithm for replicated data management. In Proc. 4th ACM SIGACT/SIGMOD Symp. on the Principles of Database Systems, pages 215--229, Portland, OR, March 1985.
Virtually-Synchronous Communication Based on a Weak Failure.. - Schiper, Ricciardi (1993) (71 citations) (Correct)
....in which processes may crash and the network may partition. However, despite network partitions, this membership service defines only majority views a unique, totally ordered sequence of views. Such a membership service is said to have linear semantics. ffl The membership services described in [1, 2, 12] consider the same failure scenario as above, but only define a partial order on the views. That is, if the system is partitioned in two (or more) subnetworks then two (or Paper appeared in IEEE Proc of the 23rd Annual Int. Symp. on Fault Tolerant Computing (FTCS23) Toulouse, June 22 24, ....
....overlap, we say the membership service semantics are weak partial, if they may not we say the semantics are strong partial. Among those that permit concurrent views, 2] appears to be a strong partial membership service. 12] considers both strong partial and weak partial membership services, and [1] considers only weak partial membership service. These variants raise a new, pertinent question: when is a strong partial service required, and when does a weak partial membership service suffice. The objective of this paper is to suggest an answer to this question, by showing that a ....
A. El Abbadi, D. Skeen, and F. Cristian. An Efficient, Fault-Tolerant Algorithm for Replicated Data Management. In Proceedings of the 5th ACM SIGACT-SIGMOD Symposium on the Principles of Database Systems, pages 215--229. A.C.M., 1985.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC