How to assign votes in a distributed system
Journal of the ACM (JACM)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
Nondominated k-coteries for multiple mutual exclusion
Information Processing Letters
Comments on "Availability of k-Coterie"
IEEE Transactions on Computers
Erratum to “Nondominated k-coteries for multiple mutual exclusion”
Information Processing Letters
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
Coterie Join Operation and Tree Structured k-Coteries
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Distributed k-Mutual Exclusion Problem and k-Coteries
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
An algorithm for k-mutual exclusion in decentralized systems
Computer Communications
Hi-index | 0.00 |
Network partition, which makes it impossible for some pairs of precesses to communicate with each other, is one of the most serious network failures. Although the notion of k-coterie is introduced to design a k-mutual exclusion algorithm robust against network failures, the number of processes allowed to simultaneously access the critical section may fatally decrease once network partition occurs. This paper discusses how to construct a k-coterie such that the k-mutual exclusion algorithm adopting it is robust against network 2-partition. To this end, we introduce the notion of complementalk-coterie, and show that complemental k-coteries meet our purpose. We then give methods for constructing complemental k-coteries, and show a necessary and sufficient condition for a k-coteries to be complemental.