A DISTRIBUTED K-MUTUAL EXCLUSION ALGORITHM USING K-COTERIE
Citation
H. Kakugawa et al., A DISTRIBUTED K-MUTUAL EXCLUSION ALGORITHM USING K-COTERIE, Information processing letters, 49(4), 1994, pp. 213-218
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
SICI code
0020-0190(1994)49:4<213:ADKEAU>2.0.ZU;2-1
Abstract
The concept of k-coterie is introduced and a distributed A-mutual excl
usion algorithm is proposed using it. A k-coterie is a natural extensi
on of a coterie. The message complexity of the algorithm is O(c) when
conflicts with other processes in capturing a quorum do not occur, whe
re c is the maximum quorum size of the k-coterie the algorithm uses.