A note on consensus on dual failure modes

Hin Sing Siu*, Yeh Hao Chin, Wei Pang Yang

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

55 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
頁(從 - 到)225-230
頁數6
期刊IEEE Transactions on Parallel and Distributed Systems
7
發行號3
DOIs
出版狀態已發佈 - 1996
對外發佈

ASJC Scopus subject areas

  • 訊號處理
  • 硬體和架構
  • 計算機理論與數學

指紋

深入研究「A note on consensus on dual failure modes」主題。共同形成了獨特的指紋。

引用此