How to assign votes in a distributed system
Journal of the ACM (JACM)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Introduction to algorithms
Principles of distributed database systems
Principles of distributed database systems
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Cost and availability tradeoffs in replicated data concurrency control
ACM Transactions on Database Systems (TODS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
An optimal voting scheme for minimizing the overall communication cost in replicated data management
Journal of Parallel and Distributed Computing
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An Analysis of the Average Message Overhead in Replica Control Protocols
IEEE Transactions on Parallel and Distributed Systems
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Replication and consistency: being lazy helps sometimes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A fully distributed quorum consensus method with high fault-tolerance and low communication overhead
Theoretical Computer Science - Special issue: theoretical computer science in Australia and New Zealand
Distributed paging for general networks
Journal of Algorithms
Update propagation protocols for replicated databates
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Deferred Updates and Data Placement in Distributed Databases
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Optimal coteries for rings and related networks
Distributed Computing
| Hi-index | 0.00 |
The management of replicated data in distributed database systems is a classic problem with great practical importance. Quorum consensus is one of the popular methods, combining with eager replication, for managing replicated data. In this paper, we will investigate the problems of delay-optimal quorum consensus. Firstly, we will show that the problem of minimizing the total-delay (or mean-delay) is NP-hard. However, we can show that the problem restricted to some specific network topology, such as trees, rings, and meshes, can be solved in polynomial time. We also developed an approximate algorithm for a general case. The algorithm gives an approximate ratio less than 2. Secondly, we will present an efficient algorithm, based on the dynamic programming technique, to solve the problem of minimizing the maximal-delay.