.png){kind=icon}
返回
A note on consensus on dual failure modes
.png){kind=icon}
OA
AI
DOI：10.1109/71.491575.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Meyer and Pradhan proposed the MS (for ''mixed-sum'') algorithm to solve the Byzantine Agreement (BA) problem with dual failure modes: arbitrary faults (Byzantine faults) and dormant faults (essentially omission faults and timing faults) [3]. Our study indicates that this algorithm uses an inappropriate method to eliminate the effects of dormant faults and that the bound on the number of allowable faulty processors is overestimated. This paper corrects the algorithm and gives a new bound for the allowable faulty processors.
Keyword:
Byzantine Agreement
consensus problem
distributed systems
dual failure modes
fault tolerance
hybrid fault model
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
.png){kind=icon}
