A 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 Given a strategy to pick quorums, the load L(S) is the minimal access probability of the busiest element, minimizing over the strategies. The capacity Cap(S) is the highest quorum accesses rate that S can handle, so Cap(S) = 1=L(S). The availability of a quorum system S is the probability that at least one quorum survives, assuming that each element fails independently with probability p. A tradeoff between L(S) and the availability of S is shown. We present four novel constructions of quorum system, all featuring optimal or near optimal load, and high availability. The best construction, based on paths in a grid, has a load of O(1= p n), and a failure probability of exp(\Gamma\Omega\Gamma p n)) when the elements fail with probability p!
|
972
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
459
|
Weighted voting for replicated data
– Gifford
- 1979
|
|
284
|
Byzantine quorum systems
– Malkhi, Reiter
- 1998
|
|
278
|
A majority consensus approach to concurrency control for multiple copy databases
– Thomas
- 1979
|
|
178
|
A √ N Algorithm for Mutual Exclusion in Decentralized Systems
– Maekawa
- 1985
|
|
166
|
How to Assign Votes in a Distributed System
– Molina, Barbara, et al.
- 1985
|
|
164
|
Consistency in partitioned networks
– Davidson, Garcia-Molina, et al.
- 1985
|
|
128
|
A quorum-consensus replication method for abstract data types
– Herlihy
- 1986
|
|
96
|
The Grid Protocol: A high performance scheme for maintaining replicated data
– Cheung, Ammar, et al.
- 1992
|
|
92
|
Algorithms for Mutual Exclusion
– Raynal
- 1986
|
|
80
|
Hierarchical quorum consensus: A new algorithm for managing replicated data
– Kumar
- 1991
|
|
77
|
Fast algorithms for shortest paths in planar graphs, with applications
– Frederickson
- 1987
|
|
74
|
Correlation inequalities on some partially ordered sets
– Fortuin, Kasteleyn, et al.
- 1971
|
|
62
|
A.: The load, capacity, and availability of quorum systems
– Naor, Wool
- 1998
|
|
62
|
monotone formulae for the majority function
– Short
- 1984
|
|
61
|
An Efficient and FaultTolerant Solution for Distributed Mutual Exclusion
– Agrawal, Abbadi
- 1991
|
|
54
|
The critical probability of bond percolation on the square lattice equals 1/2. Communication inMathematical Physics
– Kesten
- 1980
|
|
52
|
The Reliability of Voting Mechanisms
– BARBARA, GARCIA-MOLINA
- 1987
|
|
28
|
L.: On a sharp transition from area law to perimeter law in a system of random surfaces
– Aizenman, Chayes, et al.
- 1983
|
|
28
|
Éssai sur l’application de l’analyse à la probabilité des décisions rendues à la pluralité des voix
– Condorcet
|
|
27
|
A high availability p n hierarchical grid algorithm for replicated data
– Kumar, Cheung
- 1991
|
|
27
|
Coincidence of critical points in percolation problems
– Menshikov
- 1986
|
|
25
|
Distributed selective dissemination of information
– Yan, Garcia-Molina
- 1994
|
|
22
|
Voting as the optimal static pessimistic scheme for managing replicated data
– Spasojevic, Berman
- 1994
|
|
18
|
Percolation theory and computing with faulty arrays of processors
– Mathies
- 1992
|
|
17
|
A performance study of general grid structures for replicated data
– Kumar, Rabinovich, et al.
- 1993
|
|
14
|
Maximum flow in (s; t) planar networks
– Hassin
- 1981
|
|
13
|
Amplification and Percolation
– Dubiner, Zwick
- 1992
|
|
12
|
The ellipsoid method and its consequences in combinatorial optimization
– otschel, asz, et al.
- 1981
|
|
12
|
Load balancing in quorum systems
– Holzman, Marcus, et al.
- 1997
|
|
11
|
Tripathi, “Capacity of voting systems
– Rangarajan, Jalote, et al.
- 1993
|
|
11
|
Robust Distributed Mutual Exclusion Algorithms
– Ranagarajan, Tripathi
- 1991
|
|
11
|
The triangular lattice protocol: A highly fault tolerant protocol for replicated data
– Wu, Belford
- 1992
|
|
8
|
Maximum flow in planar networks
– Itai, Shiloach
- 1979
|
|
7
|
Dual integer linear programs and the relationship between their optima
– Aharoni, Erdos, et al.
- 1985
|
|
7
|
Construction methods for quorum systems
– Marcus, Peleg
- 1992
|
|
4
|
asz, Coverings and colorings of hypergraphs
– Lov'
- 1973
|
|
4
|
Replica control protocols that guarantee high availability and low access cost
– Wu
- 1993
|
|
3
|
os and L. Lov' asz, Problems and results on 3-chromatic hypergraphs and some related questions
– Erd
- 1975
|
|
2
|
Vit' anyi
– Mullender, B
- 1988
|
|
2
|
control and signatures via quorum secret sharing
– Access
- 1996
|
|
