How to assign votes in a distributed system
Journal of the ACM (JACM)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A high availability N hierarchical grid algorithm for replicated data
Information Processing Letters
Quorum structures in distributed systems
Quorum structures in distributed systems
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
The availability of quorum systems
Information and Computation
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks
IEEE Transactions on Computers
An Efficient SuperGrid Protocol for High Availability and Load Balancing
IEEE Transactions on Computers
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Revisiting Hierarchical Quorum Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
Hi-index | 0.00 |
A coterie is a set of subsets (called quorums) of the processes in a distributed system such that any two quorums intersect with each other and is mainly used to solve the mutual exclusion problem in a quorum-based algorithm. The choice of a coterie sensitively affects the performance of the algorithm and it is known that nondominated (ND) coteries achieve good performance in terms of criteria such as availability and load. On the other hand, grid coteries have some other attractive features: 1) A quorum size is small, which implies a low message complexity, and 2) a quorum is constructible on the fly, which benefits a low space complexity. However, they are not ND coteries unfortunately. To construct ND coteries having the favorite features of grid coteries, we introduce the transversal merge operation that transforms a dominated coterie into an ND coterie and apply it to grid coteries. We call the constructed ND coteries ND grid coteries. These ND grid coteries have availability higher than the original ones, inheriting the above desirable features from them. To demonstrate this fact, we then investigate their quorum size, load, and availability, and propose a dynamic quorum construction algorithm for an ND grid coterie.