このエントリーをはてなブックマークに追加
ID 14150
本文ファイル
著者
キーワード
Distributed systems
complemental
k-coteries
k-semicoteries
k-mutual exclusion problem
network 2-partition
nondominatedness
quorums
NDC
情報科学
抄録(英)
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.
掲載誌名
IEEE transactions on parallel and distributed systems
15巻
7号
開始ページ
666
終了ページ
672
出版年月日
2004-07
出版者
IEEE
ISSN
1045-9219
言語
英語
NII資源タイプ
学術雑誌論文
広大資料タイプ
学術雑誌論文
DCMIタイプ
text
フォーマット
application/pdf
著者版フラグ
publisher
権利情報
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.
関連情報URL(IsVersionOf)
http://dx.doi.org/10.1109/TPDS.2004.23
部局名
社会科学研究科