TY - JOUR

T1 - k-Coteries for tolerating network 2-partition

AU - Harada, Takashi

AU - Yamashita, Masafumi

N1 - Funding Information:
The authors are grateful to the anonymous referees for their careful reviews of the paper and many helpful comments and suggestions. An extended abstract of this paper appears in the Proceedings of the Sixth International Conference on Principles of Distributed Systems [8]. The authors gratefully acknowledge the partial support of the Scientific Grant in Aid by the Ministry of Education, Science, Sports, Culture, and Technology of Japan.

PY - 2004/7

Y1 - 2004/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=3242707906&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3242707906&partnerID=8YFLogxK

U2 - 10.1109/TPDS.2004.23

DO - 10.1109/TPDS.2004.23

M3 - Article

AN - SCOPUS:3242707906

VL - 15

SP - 666

EP - 672

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 7

ER -