A distributed k-mutual exclusion algorithm using k-coterie

Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae

Research output: Contribution to journalArticlepeer-review

32 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)213-218
Number of pages6
JournalInformation Processing Letters
Issue number4
Publication statusPublished - Feb 25 1994
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'A distributed k-mutual exclusion algorithm using k-coterie'. Together they form a unique fingerprint.

Cite this