(t, k)-Diagnosability for Regular Networks

被引:7
作者
Chang, Guey-Yun [1 ]
机构
[1] Natl Cent Univ, Dept Comp Sci & Informat Engn, Tao Yuan 320, Taiwan
关键词
Diagnosability; diagnosis algorithm; fault diagnosis; matching composition; network; PMC model; system-level diagnosis; (t; k)-diagnosis; torus; COMPARISON DIAGNOSIS MODEL; MATCHING COMPOSITION NETWORKS; SEQUENTIAL DIAGNOSIS; ENHANCED HYPERCUBES; DIAGNOSABILITY; SYSTEMS; GRAPHS;
D O I
10.1109/TC.2010.16
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
System-level diagnosis aims to identify faulty processors in a multiprocessor system by means of analyzing the test results among the processors. (t, k)-Diagnosis, which is one of the most important system-level diagnosis strategies, requires at least k faulty processors identified in each iteration provided there are at most t faulty processors, where t >= k. In this paper, a new (t, k)-diagnosis algorithm for regular networks is proposed. Experimental results show that the proposed algorithm has larger values of t for tori and matching composition networks, in comparison with previous (t, k)-diagnosis algorithms.
引用
收藏
页码:1153 / 1157
页数:5
相关论文
共 19 条