By Topic

Diagnosis of parallel computers arbitrary connectivity

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

2 Author(s)
Qian-Yu Tang ; Dept. d''IRO, Montreal Univ., Que., Canada ; Xiaoyu Song

Recently, D. Fussell and S. Rangarajan (1989) considered performing multiple tests to achieve correct diagnosis of constant degree connection structures. They showed that the probability of correctly identifying every processor approaches one as n→∞, where n is the number of processors in the system. In this paper, we give the performance analysis for the probabilistic diagnosis algorithm defined previously. In comparison with previous results, we first derive a different and formal proof for the analytic expression of the probability processor is correctly identified. We then show an exact analytic expression for the probability of the event that a faulty processor is correctly identified. Our result improves the previous results. Based on our new results, we finally give the asymptotic analysis for the algorithm. We demonstrate that the probability of correctly identifying every processor approaches one as n→∞

Published in:

Computers, IEEE Transactions on  (Volume:48 ,  Issue: 7 )