Exact Parallel Plurality Voting Algorithm for Totally Ordered Object Space Fault-Tolerant Systems

Plurality voter is one of the commonest voting methods for decision making in highly-reliable applications in which the reliability and safety of the system is critical. to resolve the problem associated with sequential plurality voter in dealing with large number of inputs, this paper introduces a new generation of plurality voter based on parallel algorithms. since parallel algorithms normally have high processing speed and are especially appropriate for large scale systems, they are therefore used to achieve a new parallel plurality voting algorithm by using (n/log n) processors on erew shared-memory pram. the asymptotic analysis of the new proposed algorithm has demonstrated that it has a time complexity of o(log n) which is less than time complexity of sequential plurality algorithm, i.e. ω (n log n)