Home > Published Issues > 2011 > Volume 2, No. 3, August 2011 >

A Novel History Based Weighted Voting Algorithm for Safety Critical Systems

PhaniKumar Singamsetty1 and Seetha Ramaiah Panchumarthy2
1. Department of CSE, Bharath University, Chennai, India
2. Department of CS&SE, Andhra University College of Engineering, Visakhapatnam, India

Abstract—Safety critical systems are the systems which may lead to hazards, loss of lives and great damage to the property if they fail due to errors which may lead to faults. N-Modular Redundancy or N-Version Programming along with the voter is used in the safety critical systems to mask the faults. In this paper different existing weighted average voting algorithms are surveyed and their merits and demerits or limitations are discussed based upon which a novel History based weighted Voting algorithm with Soft Dynamic Threshold is proposed. Experimentation results of the novel voting algorithm for Triple Modular Redundant (TMR) system are compared with existing voting algorithms and the novel voter is giving almost 100% Safety if two of the three modules are error free and giving better results for one error free module. Novel voter is also giving better results for the multiple error conditions with all the modules having errors.

Index Terms—Triple Modular Redundancy, Result Amalgamation, Weighted Average Voters, History Records, Soft Dynamic Threshold, Safety Critical Systems

Cite: PhaniKumar Singamsetty and Seetha Ramaiah Panchumarthy, "A Novel History based Weighted Voting Algorithm for Safety Critical Systems," Journal of Advances in Information Technology, Vol. 2, No. 3, pp. 139-145, August, 2011.doi:10.4304/jait.2.3.139-145