Experimental comparison of voting algorithms in cases of disagreement

Bass, J.M.; Latif-Shabgahi, G.; Bennett, S.

Abstract

Voting algorithms are used to mask erroneous results from redundant subsystems (variants) in fault tolerant systems. While voting algorithms are well known and widely used, the authors are not aware of any detailed investigation of voter behaviour in the presence of multiple errors. The results of an experimental evaluation of seven voting algorithms in a variety of simulated error scenarios are reported. A software error injection approach is used to simulate multiple errors in a triple modular redundant configuration. The Majority and Plurality voters produce the lowest number of catastrophic errors, in these tests. The Median voter produces the largest number of correct results, but also produces the largest number of catastrophic errors. The Three Domain voter results show a compromise between the large number of correct results identified by the Median voter and the small number of catastrophic results produced by the Majority voter.

Citation

Bass, J., Latif-Shabgahi, G., & Bennett, S. (1997). Experimental comparison of voting algorithms in cases of disagreement. . https://doi.org/10.1109/EURMIC.1997.617368

• Conference Name: 23rd EUROMICRO Conference: New Frontiers of Information Technology
• Conference Location: Budapest, Hungary
• Start Date: Sep 1, 1997
• End Date: Sep 4, 1997
• Online Publication Date: Aug 6, 2002
• Publication Date: 1997
• Deposit Date: Jan 11, 2024
• Publisher: Institute of Electrical and Electronics Engineers
• DOI: https://doi.org/10.1109/EURMIC.1997.617368