A new diagnosis algorithm for determining the existing fault situation in a symmetric multiple processor architecture is given. The algorithm assumes that there are n processors, each of which is tested by at least t other processors, and at most t of which are faulty. The existing fault situation is always diagnosed if n ≥ 2t + 1 and, in some cases, can still be diagnosed if n < 2t + 1. The implementation of the algorithm is straightforward and suitable for microprocessor applications.
No takes yet. Share an insight, caveat, or question.
Meyer et al. (1978) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: