k-coteries for tolerating network 2-Partition
IEEE_2004_15_7_l0666.pdf 333 KB
k-mutual exclusion problem
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
|date of issued||
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||
Graduate School of Social Sciences
Last 12 months's access : ? times
Last 12 months's DL: ? times
This month's access: ? times
This month's DL: ? times