Sciweavers

13 search results - page 2 / 3
» The Load and Availability of Byzantine Quorum Systems
Sort
View
PODC
2003
ACM
13 years 10 months ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder
SRDS
2007
IEEE
13 years 11 months ago
Evaluating Byzantine Quorum Systems
Replication is a mechanism extensively used to guarantee the availability and good performance of data storage services. Byzantine Quorum Systems (BQS) have been proposed as a sol...
Wagner Saback Dantas, Alysson Neves Bessani, Joni ...
CP
2010
Springer
13 years 3 months ago
Load Balancing and Almost Symmetries for RAMBO Quorum Hosting
Abstract. Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where t...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
PODC
2004
ACM
13 years 10 months ago
Signed quorum systems
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...
Haifeng Yu
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
13 years 10 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor