A practical method for constructing a semi-optimal coterie

Takashi Harada, Masafumi Yamashita

Research output: Contribution to journalArticlepeer-review

Abstract

SUMMARY A coterie is a set of quorums such that any two quorums intersect each other, and is used in a quorum based algorithm for solving the mutual exclusion problem. The availability of a coterie is the probability that the algorithm (adopting the coterie) tolerates process and/or link failures. Constructing an optimal coterie in terms of the availability is therefore important from the view of fault tolerance, but unfortunately, even calculating the availability is known to be #P-hard. Recently Harada and Yamashita proposed several heuristic methods for improving the availability of a coterie. This letter first evaluates their performance and then proposes a practical method for constructing a semi-optimal coterie by using one of the heuristic methods as a main component.

Original languageEnglish
Pages (from-to)1634-1638
Number of pages5
JournalIEICE Transactions on Information and Systems
VolumeE82-D
Issue number12
Publication statusPublished - Jan 1 1999

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A practical method for constructing a semi-optimal coterie'. Together they form a unique fingerprint.

Cite this