How to assign votes in a distributed system
Journal of the ACM (JACM)
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
Performance Characterization of Quorum-Consensus Algorithms for Replicated Data
IEEE Transactions on Software Engineering
Exploiting logical structures in replicated databases
Information Processing Letters
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Bounded ignorance in replicated systems
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
Comments on "Availability of k-Coterie"
IEEE Transactions on Computers
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
IEEE Transactions on Computers
A Robust Distributed Mutual Exclusion Algorithm
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Distributed k-Mutual Exclusion Problem and k-Coteries
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion
Coterie Join Operation and Tree Structured k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Optimal k-Coteries That Maximize Availability in General Networks
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
k-Coteries for Tolerating Network 2-Partition
IEEE Transactions on Parallel and Distributed Systems
An algorithm for k-mutual exclusion in decentralized systems
Computer Communications
| Hi-index | 0.00 |
A generalization of the majority quorum for the solution of the distributed (k + 1)-exclusion problem is proposed. This scheme produces a family of quorums of varying sizes and availabilities indexed by integral divisors r of k. The cases r = 1 and r = k correspond to known majority based quorum generation algorithms MAJ and DIV, whereas intermediate values of r interpolate between these two extremes. A cost and availability analysis of the proposed methods is also presented. An interesting implication of this analysis is that in a reasonably reliable environment with a large number of sites, even protocols with low communication costs attain high availability.