抄録
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.
| 本文言語 | 英語 |
|---|---|
| ページ（範囲） | 1634-1638 |
| ページ数 | 5 |
| ジャーナル | IEICE Transactions on Information and Systems |
| 巻 | E82-D |
| 号 | 12 |
| 出版ステータス | 出版済み - 1月 1 1999 |
!!!All Science Journal Classification (ASJC) codes
- ソフトウェア
- ハードウェアとアーキテクチャ
- コンピュータ ビジョンおよびパターン認識
- 電子工学および電気工学
- 人工知能