The concept of k-coterie is introduced and a distributed k-mutual exclusion algorithm is proposed using it. A k-coterie is a natural extension of a coterie. The message complexity of the algorithm is O(c) when conflicts with other processes in capturing a quorum do not occur, where c is the maximum quorum size of the k-coterie the algorithm uses.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications