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 language | English |
|---|---|
| Pages (from-to) | 1634-1638 |
| Number of pages | 5 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E82-D |
| Issue number | 12 |
| Publication status | Published - Jan 1 1999 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence
Cite this
A practical method for constructing a semi-optimal coterie. / Harada, Takashi; Yamashita, Masafumi.
In: IEICE Transactions on Information and Systems, Vol. E82-D, No. 12, 01.01.1999, p. 1634-1638.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A practical method for constructing a semi-optimal coterie
AU - Harada, Takashi
AU - Yamashita, Masafumi
PY - 1999/1/1
Y1 - 1999/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0033352286&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033352286&partnerID=8YFLogxK
M3 - Article
VL - E82-D
SP - 1634
EP - 1638
JO - IEICE Transactions on Information and Systems
JF - IEICE Transactions on Information and Systems
SN - 0916-8532
IS - 12
ER -