A Fault-Tolerant Voting Scheme for Multithreaded Environments

Voting schemes are widely used in fault-tolerant systems, mainly systems which imply temporal or component redundancy. We present a voting scheme for multithreaded environments which is based on the observation that a fault-tolerant system which does not know its history can not distinguish between transient (SEUs) and permanent errors, caused by use of a faulty component. The history of errors is used to predict future errors and to determine if a permanent or transient error occurred. Only in the former case a repair is necessary; in the latter case recovery is sufficient. Using prediction and credibility points we are able to tell if a system failure is likely to occur soon. The more credibility a version has, the more likely it will compute a correct result. Therefore we can use credibility points in connection with thread priorisation to increase performance.

[1]  Jörg Keller,et al.  Performance estimation of virtual duplex systems on simultaneous multithreaded processors , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[2]  Stuart Bennett,et al.  Experimental comparison of voting algorithms in cases of disagreement , 1997, EUROMICRO 97. Proceedings of the 23rd EUROMICRO Conference: New Frontiers of Information Technology (Cat. No.97TB100167).

[3]  Stuart Bennett,et al.  Adaptive majority voter: a novel voting algorithm for real-time fault-tolerant control systems , 1999, Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium.

[4]  Lorenzo Alvisi,et al.  Modeling the effect of technology trends on the soft error rate of combinational logic , 2002, Proceedings International Conference on Dependable Systems and Networks.