A note on consensus on dual failure modes
檔案
- A1996UF31800001.pdf (636.7 KB, Adobe PDF)
日期
1996-03-01
類型
系所
期刊名稱
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
卷期與頁次
第 7 卷第 3 期,頁 225–230
ISSN
1045-9219
語言
英文
摘要
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.