How to assign votes in a distributed system
Journal of the ACM (JACM)
Algorithms for mutual exclusion
Algorithms for mutual exclusion
Operation systems: advanced concepts
Operation systems: advanced concepts
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
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)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed k-Mutual Exclusion Problem and k-Coteries
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Comments on "Availability of k-Coterie"
IEEE Transactions on Computers
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
A Geometric Approach for Constructing Coteries and k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion
IEEE Transactions on Parallel and Distributed Systems
Efficient selection and sorting schemes using coteries for processing large distributed files
Journal of Parallel and Distributed Computing
Quorum-Based Algorithms for Group Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
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
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
(h, k)-Arbiters for h-out-of-k mutual exclusion problem
Theoretical Computer Science
k-Coteries for Tolerating Network 2-Partition
IEEE Transactions on Parallel and Distributed Systems
Optimal decision strategies in Byzantine environments
Journal of Parallel and Distributed Computing
An algorithm for k-mutual exclusion in decentralized systems
Computer Communications
Quorum based distributed conflict resolution algorithm for bounded capacity resources
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
| Hi-index | 14.99 |
The distributed k-mutual-exclusion problem (k-mutex problem) is the problem of guaranteeing that at most k processes at a time can enter a critical section at a time in a distribution system. A method proposed for the solution of the distributed mutual exclusion problem (i.e., 1-mutex problem) by D. Barbara and H. Garcia-Molina (1987) is an extension of majority consensus and uses coteries. The goodness of coterie-based 1-mutex algorithm strongly depends on the availability of coterie, and it has been shown that majority coterie is optimal in this sense, provided that: the network topology is a complete graph, the links never fail, and p, the reliability of the process, is at least 1/2. The concept of a k-coterie, an extension of a coterie, is introduced for solving the k-mutex problem, and lower and upper bounds are derived on the reliability p for k-majority coterie, a natural extension of majority coterie, to be optimal, under conditions (1)-(3). For example, when k=3, p must be greater than 0.994 for k-majority coterie to be optimal.