Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
Epidemic quorum systems enable highly available agreement even when a quorum is not simultaneously connected, and are therefore very interesting for mobile networks. Although rece...
Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probabi...
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...