Title :
A note on consensus on dual failure modes
Author :
Siu, Hin-Sing ; Chin, Yeh-Hao ; Yang, Wei-Pang
Author_Institution :
Inst. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fDate :
3/1/1996 12:00:00 AM
Abstract :
F.J. Meyer and D.K. Pradhan (1991) 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). 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
Keywords :
distributed processing; fault tolerant computing; Byzantine Agreement; Byzantine faults; allowable faulty processors; arbitrary faults; dormant faults; dual failure modes; mixed-sum algorithm; Computer crashes; Computer science; Electronic mail; Fault detection; Fault tolerant systems; Senior members; Timing; Transmitters; Voting;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
