IEEE Transactions on Computers
Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion
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
(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
| Hi-index | 14.98 |
H. Kakugawa et al. (1993) proposed the k-majority coterie for the distributed k-mutual exclusion problem (k-mutex). It was claimed that the k-majority coterie is a k-coterie, which is a general solution for k-mutex. In this comment, we show that the k-majority coterie is not necessary a k-coterie.