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

Original language | English |
---|---|

Pages (from-to) | 666-672 |

Number of pages | 7 |

Journal | IEEE Transactions on Parallel and Distributed Systems |

Volume | 15 |

Issue number | 7 |

DOIs | |

Publication status | Published - Jul 1 2004 |

### All Science Journal Classification (ASJC) codes

- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics

### Cite this

*IEEE Transactions on Parallel and Distributed Systems*,

*15*(7), 666-672. https://doi.org/10.1109/TPDS.2004.23