k-coteries for tolerating network 2-Partition

IEEE transactions on parallel and distributed systems Volume 15 Issue 7 Page 666-672 published_at 2004-07
アクセス数 : 942
ダウンロード数 : 215

今月のアクセス数 : 0
今月のダウンロード数 : 0
File
IEEE_2004_15_7_l0666.pdf 333 KB 種類 : fulltext
Title ( eng )
k-coteries for tolerating network 2-Partition
Creator
Source Title
IEEE transactions on parallel and distributed systems
Volume 15
Issue 7
Start Page 666
End Page 672
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.
Keywords
Distributed systems
complemental
k-coteries
k-semicoteries
k-mutual exclusion problem
network 2-partition
nondominatedness
quorums
NDC
Information science [ 007 ]
Language
eng
Resource Type journal article
Publisher
IEEE
Date of Issued 2004-07
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.
Publish Type Version of Record
Access Rights open access
Source Identifier
[ISSN] 1045-9219
[DOI] http://dx.doi.org/10.1109/TPDS.2004.23 isVersionOf