Nondominated k-coteries for multiple mutual exclusion
Information Processing Letters
Comments on "Availability of k-Coterie"
IEEE Transactions on Computers
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Performance-Related Reliability Measures for Computing Systems
IEEE Transactions on Computers
| Hi-index | 0.00 |
We consider a distributed system where there are k indistinguishable shared resources that require exclusive access by different computing nodes. The k-mutual exclusion problem is the problem of guaranteeing the resource access request in such a way that no more than k computing nodes enter a critical section simultaneously. The use of a k-coterie, which is a special set of node groups, is known as a robust approach to this problem. In this paper, we address the problem of constructing optimal k-coteries in terms of availability in general topology networks with unreliable nodes and links.We formulate the problem of constructing an optimal k-coterie as a combinatorial optimization problem with a linear objective function. To solve the formulated problem, we propose a branch-and-bound method based on a linear programming relaxation. The feasibility of the proposed method is shown through an experiment conducted for several networks.