AbstractA quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mutual exclusion, data replication, and dissemination of information. In this paper we study the failure probabilities of quorum systems and in particular of nondominated coteries (NDC). We characterize NDC′s in terms of the failure probability, and prove that any NDC has availability that falls between that of a singleton and a majority consensus. We show conditions for weighted voting schemes to provide asymptotically high availability, and we analyze the availability of several other known quorum systems
A generalization of the majority quorum for the solution of the distributed (k +1)-exclusion problem...
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum...
AbstractWe initiate the study of probabilistic quorum systems, a technique for providing consistency...
AbstractA quorum system is a collection of sets (quorums) every two of which intersect. Quorum syste...
. A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems ha...
AbstractA quorum system is a set system in which any two subsets have nonempty intersection. Quorum ...
AbstractA quorum system is a collection of sets (quorums) every two of which intersect. Quorum syste...
A quorum system is a set system in which any two subsets have nonempty intersection. Quorum systems ...
Quorum systems are well-known tools for ensuring the consistency and availability of replicated data...
A system that implements the byzantine agreement algorithm is supposed to be very reliable and robus...
A system that implements the byzantine agreement algorithm is supposed to be very reliable and robus...
Using quorum to synchronize access to a shared resource in a distributed system is attractive becaus...
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In o...
AbstractQuorum systems are used to implement many coordination problems in distributed systems such ...
Abstract With n servers that independently fail with probability of p < 0.5, it is well known tha...
A generalization of the majority quorum for the solution of the distributed (k +1)-exclusion problem...
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum...
AbstractWe initiate the study of probabilistic quorum systems, a technique for providing consistency...
AbstractA quorum system is a collection of sets (quorums) every two of which intersect. Quorum syste...
. A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems ha...
AbstractA quorum system is a set system in which any two subsets have nonempty intersection. Quorum ...
AbstractA quorum system is a collection of sets (quorums) every two of which intersect. Quorum syste...
A quorum system is a set system in which any two subsets have nonempty intersection. Quorum systems ...
Quorum systems are well-known tools for ensuring the consistency and availability of replicated data...
A system that implements the byzantine agreement algorithm is supposed to be very reliable and robus...
A system that implements the byzantine agreement algorithm is supposed to be very reliable and robus...
Using quorum to synchronize access to a shared resource in a distributed system is attractive becaus...
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In o...
AbstractQuorum systems are used to implement many coordination problems in distributed systems such ...
Abstract With n servers that independently fail with probability of p < 0.5, it is well known tha...
A generalization of the majority quorum for the solution of the distributed (k +1)-exclusion problem...
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum...
AbstractWe initiate the study of probabilistic quorum systems, a technique for providing consistency...