By Topic

(t, k)-Diagnosability for Regular Networks

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
$31 $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

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.

Published in:

Computers, IEEE Transactions on  (Volume:59 ,  Issue: 9 )