How to assign votes in a distributed system
Journal of the ACM (JACM)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
How to share memory in a distributed system
Journal of the ACM (JACM)
Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Theoretical Computer Science - Special issue on computing and combinatorics
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
Approximation algorithms for min-sum p-clustering
Discrete Applied Mathematics
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A Fault-Tolerant Algorithm for Decentralized On-line Quorum Adaptation
FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
Atomic shared register access by asynchronous hardware
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Geometric algorithms for the minimum cost assignment problem
Random Structures & Algorithms
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Cell approximation method in quorum systems for minimizing access time
Cluster Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
Quorum systems are commonly used to maintain the consistency of replicated data in a distributed system. Much research has been devoted to developing quorum systems with good theoretical properties, such as fault tolerance and high availability. However, even given a theoretically good quorum system, it is not obvious how to efficiently deploy such a system in a real network. This paper introduces a new combinatorial optimization problem, the Quorum Deployment Problem, and studies its complexity. We demonstrate that it is NP-hard to approximate the Quorum Deployment Problem within any factor of nδ, where n is the number of nodes in the distributed network and δ 0. The problem is NP-hard in even the simplest possible distributed network: a one-dimensional line with metric cost. We begin to study algorithms for variants of the problem. Some variants can be solved optimally in polynomial time and some NP-hard variants can be approximated to within a constant factor.