IEICE TRANSACTIONS on Information
New Constructions for Nondominated k-Coteries
Summary :
The k-mutual exclusion problem is the problem of guaranteeing that no more than k computing nodes enter a critical section simultaneously. The use of a k-coterie, which is a special set of node groups, is known as a robust approach to this problem. In general, k-coteries are classified as either dominated or nondominated, and a mutual exclusion mechanism has maximal availability when it employs a nondominated k-coterie. In this paper, we propose two new schemes called VOT and D-VOT for constructing nondominated k-coteries. We conduct a comparative evaluation of the proposed schemes and well-known previous schemes. The results clearly show the superiority of the proposed schemes.
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.7 pp.1526-1532
- Publication Date
- 2000/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Fault Tolerance
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Eun Hye CHOI, Tatsuhiro TSUCHIYA, Tohru KIKUNO, "New Constructions for Nondominated k-Coteries" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 7, pp. 1526-1532, July 2000, doi: .
Abstract: The k-mutual exclusion problem is the problem of guaranteeing that no more than k computing nodes enter a critical section simultaneously. The use of a k-coterie, which is a special set of node groups, is known as a robust approach to this problem. In general, k-coteries are classified as either dominated or nondominated, and a mutual exclusion mechanism has maximal availability when it employs a nondominated k-coterie. In this paper, we propose two new schemes called VOT and D-VOT for constructing nondominated k-coteries. We conduct a comparative evaluation of the proposed schemes and well-known previous schemes. The results clearly show the superiority of the proposed schemes.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_7_1526/_p
Copy
@ARTICLE{e83-d_7_1526,
author={Eun Hye CHOI, Tatsuhiro TSUCHIYA, Tohru KIKUNO, },
journal={IEICE TRANSACTIONS on Information},
title={New Constructions for Nondominated k-Coteries},
year={2000},
volume={E83-D},
number={7},
pages={1526-1532},
abstract={The k-mutual exclusion problem is the problem of guaranteeing that no more than k computing nodes enter a critical section simultaneously. The use of a k-coterie, which is a special set of node groups, is known as a robust approach to this problem. In general, k-coteries are classified as either dominated or nondominated, and a mutual exclusion mechanism has maximal availability when it employs a nondominated k-coterie. In this paper, we propose two new schemes called VOT and D-VOT for constructing nondominated k-coteries. We conduct a comparative evaluation of the proposed schemes and well-known previous schemes. The results clearly show the superiority of the proposed schemes.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - New Constructions for Nondominated k-Coteries
T2 - IEICE TRANSACTIONS on Information
SP - 1526
EP - 1532
AU - Eun Hye CHOI
AU - Tatsuhiro TSUCHIYA
AU - Tohru KIKUNO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2000
AB - The k-mutual exclusion problem is the problem of guaranteeing that no more than k computing nodes enter a critical section simultaneously. The use of a k-coterie, which is a special set of node groups, is known as a robust approach to this problem. In general, k-coteries are classified as either dominated or nondominated, and a mutual exclusion mechanism has maximal availability when it employs a nondominated k-coterie. In this paper, we propose two new schemes called VOT and D-VOT for constructing nondominated k-coteries. We conduct a comparative evaluation of the proposed schemes and well-known previous schemes. The results clearly show the superiority of the proposed schemes.
ER -
English
