k-coteries for tolerating network 2-Partition

IEEE transactions on parallel and distributed systems 15 巻 7 号 666-672 頁 2004-07 発行
アクセス数 : 943
ダウンロード数 : 215

今月のアクセス数 : 1
今月のダウンロード数 : 0
ファイル情報(添付)
IEEE_2004_15_7_l0666.pdf 333 KB 種類 : 全文
タイトル ( eng )
k-coteries for tolerating network 2-Partition
作成者
収録物名
IEEE transactions on parallel and distributed systems
15
7
開始ページ 666
終了ページ 672
抄録
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.
著者キーワード
Distributed systems
complemental
k-coteries
k-semicoteries
k-mutual exclusion problem
network 2-partition
nondominatedness
quorums
NDC分類
情報科学 [ 007 ]
言語
英語
資源タイプ 学術雑誌論文
出版者
IEEE
発行日 2004-07
権利情報
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.
出版タイプ Version of Record(出版社版。早期公開を含む)
アクセス権 オープンアクセス
収録物識別子
[ISSN] 1045-9219
[DOI] http://dx.doi.org/10.1109/TPDS.2004.23 ~の異版である