.png){kind=icon}
返回
k-coteries for tolerating network 2-partition
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2004.23.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
distributed systems
complemental
k-coteries
k-semicoteries
k-mutual exclusion problem
network 2-partition
nondominatedness
quorums
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
Author response: Postural control of arm and fingers through integration of movement commands.png)
OAAI
IF0
OAAI分享收藏
查看更多内容