.png){kind=icon}
返回
Evaluation of a diagnosis algorithm for regular structures
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2002.1017704.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of identifying the faulty units in regularly interconnected systems is addressed. The diagnosis is based on mutual tests of units, which are adjacent in the system graph describing the interconnection structure. This paper evaluates an algorithm named EDARS (Efficient Diagnosis Algorithm for Regular Structures). The diagnosis provided by this algorithm is provably correct and almost complete with high probability. Diagnosis correctness is guaranteed if the cardinality of the actual fault set is below a syndrome-dependent bound, asserted by the algorithm itself along with the diagnosis. Evaluation of EDARS relies upon extensive simulation which covered grids, hypercubes, and cube-connected cycles (CCC). Simulation experiments showed that the degree of the system graph has a strong impact over diagnosis completeness and affects the syndrome-dependent bound, ensuring correctness. Furthermore, a comparative analysis of the performance of EDARS, with hypercubes and CCCs on one side and grids of the same size and degree on the other side, showed that diameter and bisection width of the system graph also influence the diagnosis correctness and completeness.
Keyword:
fault tolerance
system-level diagnosis
PMC model
multiprocessor systems
wafer-scale testing
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
暂无机构信息
引用论文
分享收藏
High gamma-aminobutyric acid level in cortical tubers in epileptic infants with tuberous sclerosis complex measured with the MEGA-editing J-difference method and a three-Tesla clinical MRI Instrument.png)
NeuroImage
NeuroImageIF0
PREAI
分享收藏分享收藏分享收藏
查看更多内容