.png){kind=icon}
返回
A geometric approach for constructing coteries and k-coteries
.png){kind=icon}
PRE
AI
DOI：10.1109/71.588618.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. Recently, some mutual exclusion algorithms successfully use logical structures to construct coteries with small quorums sizes, In this paper, we introduce a geometric approach on dealing with the logical structures and present some useful geometric properties for constructing coteries and k-coteries. Based on those geometric properties, a logical structure named three-sided graph is proposed to provide a new scheme for constructing coteries with small quorums: The smallest quorum size is O(root N) in a homogeneous system with N nodes and O(1) in a heterogeneous system. In addition, we also extend the three-sided graph to the n-sided graph for constructing k-coteries.
Keyword:
coterie
critical section
distributed algorithm
fault-tolerance
mutual exclusion
quorum set
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
REPORT UPON THE AUTUMN INFLUENZA EPIDEMIC (1918) AS IT AFFECTED THE N.Z.E.F. IN THE UNITED KINGDOM..png)
The Lancet
OAAI
The LancetIF0
OAAI分享收藏分享收藏分享收藏 没有更多内容
没有更多内容