A note on consensus on dual failure modes

檔案

日期

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Siu, H., Chin, Y., & Yang, W. (1996). A note on consensus on dual failure modes. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 7(3), 225–230. https://doi.org/10.1109/71.491575

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/1403