Conditional ({t}, k)-Diagnosis under the PMC Model
Guey-Yun Chang · IEEE Transactions on Parallel and Distributed Systems · 2011
In this paper, assuming that each vertex is neighboring to at least one fault-free vertex, we investigate the (t,k)-diagnosability of a graph G under the PMC model. Lower bounds on the numeric degrees of (t,k)-diagnosability are suggested when G is a general graph or G is a regular graph. In particular, the following results are obtained. Symmetric d-dimensional grids are ({N-m\over 2d}, {\min} \{m, 2d-1\} )-diagnosable, where d\ge 2, 1\le m\le 2d-1, and N are the number of vertices. Symmetric d-dimensional tori are ({N+0.62 N^{{2\over 3} }-2\over 4},1)-diagnosable if d=2, and ({N-m\over 2d}, {\min} \{m, 4d-2\} )-diagnosable if d\ge 3, where 1\le m\le 4d-2. Hypercubes are ({N-2\log N+2\over \log N},2\log N-2)-diagnosable. Cube-connected cycles are ({N-m\over 3}, {\min} \{m, 4\} )-diagnosable, where 1\le m \le 4; k-ary trees are ({N-1\over k}, 1)-diagnosable.