このエントリーをはてなブックマークに追加
ID 14150
file
creator
subject
Distributed systems
complemental
k-coteries
k-semicoteries
k-mutual exclusion problem
network 2-partition
nondominatedness
quorums
NDC
Information science
abstract
Network partition, which makes it impossible for some pairs of precesses to communicate with each other, is one of the most serious network failures. Although the notion of k-coterie is introduced to design a k-mutual exclusion algorithm robust against network failures, the number of processes allowed to simultaneously access the critical section may fatally decrease once network partition occurs. This paper discusses how to construct a k-coterie such that the k-mutual exclusion algorithm adopting it is robust against network 2-partition. To this end, we introduce the notion of complemental k-coterie, and show that complemental k-coteries meet our purpose. We then give methods for constructing complemental k-coteries, and show a necessary and sufficient condition for a k-coteries to be complemental.
journal title
IEEE transactions on parallel and distributed systems
volume
Volume 15
issue
Issue 7
start page
666
end page
672
date of issued
2004-07
publisher
IEEE
issn
1045-9219
language
eng
nii type
Journal Article
HU type
Journal Articles
DCMI type
text
format
application/pdf
text version
publisher
rights
Copyright (c) 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
relation is version of URL
http://dx.doi.org/10.1109/TPDS.2004.23
department
Graduate School of Social Sciences