Speed-Efficiency-Complexity Tradeoffs in Universal Diagnosis Algorithms
Butler · IEEE Transactions on Computers · 1981
Expressions are derived for the average number of steps. required (speed) and the average number of fault-free units replaced (efficiency) when universal diagnosis algorithms are applied to systems of various degrees of interconnection (complexity). Specifically, two algorithms proposed by Smith [4] are considered. It is shown, for example, that there is a clear tradeoff between the two algorithms; one is much faster, while the other is more efficient.