A note on consensus on dual failure modes

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

57 Citations (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.

Original languageEnglish
Pages (from-to)225-230
Number of pages6
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number3
Publication statusPublished - 1996
Externally publishedYes


  • Byzantine Agreement
  • Consensus problem
  • Distributed systems
  • Dual failure modes
  • Fault tolerance
  • Hybrid fault model

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'A note on consensus on dual failure modes'. Together they form a unique fingerprint.

Cite this