By Topic

Conditional ({t}, k)-Diagnosis under the PMC Model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Guey-Yun Chang ; Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Jhongli, Taiwan

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-mover 2d}, {min} {m, 2d-1} )-diagnosable, where dge 2, 1le mle 2d-1, and N are the number of vertices. Symmetric d-dimensional tori are ({N+0.62 N^{{2over 3} }-2over 4},1)-diagnosable if d=2, and ({N-mover 2d}, {min} {m, 4d-2} )-diagnosable if dge 3, where 1le mle 4d-2. Hypercubes are ({N-2log N+2over log N},2log N-2)-diagnosable. Cube-connected cycles are ({N-mover 3}, {min} {m, 4} )-diagnosable, where 1le m le 4; k-ary trees are ({N-1over k}, 1)-diagnosable.

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:22 ,  Issue: 11 )