.png){kind=icon}
返回
A group membership algorithm with a practical specification
.png){kind=icon}
PRE
AI
DOI：10.1109/71.969128.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a solvable specification and gives an algorithm for the Group Membership Problem in asynchronous systems with crash failures. Our specification requires processes to maintain a consistent history in their sequences of views, This allows processes to order failures and recoveries in time and simplifies the programming of high level applications. Previous work has proven that the Group Membership Problem cannot be solved in asynchronous systems with crash failures. We circumvent this impossibility result building a weaker, yet nontrivial specification. We show that our solution is an improvement upon previous attempts to solve this problem using a weaker specification. We also relate our solution to other methods and give a classification of progress properties that can be achieved under different models.
Keyword:
distributed agreement algorithms
group membership
asynchronous systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
β-Hydroxyisovalerylshikonin and Cisplatin Act Synergistically to Inhibit Growth and to Induce Apoptosis of Human Lung Cancer DMS114 Cells via a Tyrosine Kinase-Dependent Pathway.png)
Oncology
OncologyIF0
PREAI
分享收藏
Draft Genome Sequence of
Clostridium
sp. Maddingley, Isolated from Coal-Seam Gas Formation Water
OAAI
OAAI分享收藏
查看更多内容