Diagnosis of regular structures

This paper introduces an efficient diagnosis algorithm for regular structures (EDARS). The algorithm provides a diagnosis which is correct, but possibly incomplete, if the cardinality of the actual fault set is below a "syndrome-dependent bound", asserted by the algorithm itself. The time complexity of EDARS is O(nt) when executed on t-regular structures of size n. The correctness and the completeness degree of EDARS, were evaluated by means of simulation. Grids, hypercubes and Cube-Connected Cycles (CCC) structures were considered. Simulation results with grid structures showed a strong influence of structure degree over diagnosis performance. Furthermore, comparisons of simulation results obtained with hypercubes, CCCs, and grids of same size and degree, showed that diameter and bisection width also appear to influence the performance of EDARS, particularly with respect to diagnosis completeness.