An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
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)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Availability in partitioned replicated databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
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
Enhancing concurrency and availability for database systems
Enhancing concurrency and availability for database systems
The generalized tree quorum protocol: an efficient approach for managing replicated data
ACM Transactions on Database Systems (TODS)
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
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Cost Optimal Coteries
Optimal coteries for rings and related networks
Distributed Computing
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
Distributed and Parallel Databases
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On the Asymptotical Optimality of Multilayered Decentralized Consensus Protocol
IEEE Transactions on Parallel and Distributed Systems
Delay Optimizations in Quorum Consensus
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
A delay optimal coterie on the k-dimensional folded Petersen graph
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
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
Dynamic grid quorum: a reconfigurable grid quorum and its power optimization algorithm
Service Oriented Computing and Applications
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Probabilistically bounded staleness for practical partial quorums
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Given a set of nodes S, a coterie is a set of pairwise intersecting subsets of S. Each element in a coterie is called a quorum. Mutual exclusion in a distributed system can be achieved if each request is required to get consensus from a quorum of nodes. This technique of quorum consensus is also used for replicated distributed database systems, and bicoteries and wr-coteries have been defined to capture the requirements of read and write operations in user transactions. In this paper, we are interested in finding coteries, bicoteries, and wr-coteries with optimal communication delay. The protocols take into account the network topology. We design delay-optimal quorum consensus protocols for network topologies of trees, rings, and clustered networks.