Availability Analysis of Predictive Hybrid M-Out-of-N Systems

Abstract

In m -out-of-n system, if m-out-of-n

A NovelN-Input Voting Algorithm forX-by-Wire Fault-Tolerant Systems

“…Because the minimum number of agreed but incorrect agreements in a given voter is desirable, the safety criterion can be defined as S = 1 − N ic / N t . Thus, S ∈ [0-1] and ideally S = 1 [14, 37, 38]. …”

“…Some examples are in image processing filters in which, during each pass, the value of pixels may be replaced with the values determined from the voting on the predetermined values of the neighboring points [5] or in data fusion originating from a large number of sensors [6, 7], implementation of cellular automata and neural networks [1, 8], diagnostic functions in parallel, and distributed systems and systems alike [3, 9–11]. Consequently, we need such voting algorithms which can vote on large-numbered inputs and such voting must be reasonable in respect to computation complexity [12], reliability [13], availability [14, 15], and other dependability criteria. So far, different voting algorithms have been proposed which have been efficient in some aspects more than the others based on their particular features, for example, M -out-of- N [16, 17], majority, plurality [3, 18], different weighted methods [1, 19, 20], median [5, 9], predictive [13, 21], and smoothing algorithms [22].…”