A distributed k-mutual exclusion algorithm using k-coterie

Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

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
Volume49
Issue number4
DOIs
Publication statusPublished - Feb 25 1994

Fingerprint

Mutual Exclusion
Quorum
Message Complexity
Natural Extension

All Science Journal Classification (ASJC) codes

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

Cite this

A distributed k-mutual exclusion algorithm using k-coterie. / Kakugawa, Hirotsugu; Fujita, Satoshi; Yamashita, Masafumi; Ae, Tadashi.

In: Information Processing Letters, Vol. 49, No. 4, 25.02.1994, p. 213-218.

Research output: Contribution to journalArticle

Kakugawa, Hirotsugu ; Fujita, Satoshi ; Yamashita, Masafumi ; Ae, Tadashi. / A distributed k-mutual exclusion algorithm using k-coterie. In: Information Processing Letters. 1994 ; Vol. 49, No. 4. pp. 213-218.
@article{4d0dc7ac1ed348d7bf2e16eff2aa358c,
title = "A distributed k-mutual exclusion algorithm using k-coterie",
abstract = "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.",
author = "Hirotsugu Kakugawa and Satoshi Fujita and Masafumi Yamashita and Tadashi Ae",
year = "1994",
month = "2",
day = "25",
doi = "10.1016/0020-0190(94)90014-0",
language = "English",
volume = "49",
pages = "213--218",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - A distributed k-mutual exclusion algorithm using k-coterie

AU - Kakugawa, Hirotsugu

AU - Fujita, Satoshi

AU - Yamashita, Masafumi

AU - Ae, Tadashi

PY - 1994/2/25

Y1 - 1994/2/25

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028378554&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028378554&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(94)90014-0

DO - 10.1016/0020-0190(94)90014-0

M3 - Article

AN - SCOPUS:0028378554

VL - 49

SP - 213

EP - 218

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 4

ER -