System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Algorithms for fault identification in a diagnosable multiprocessor system

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 $31
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)
Lombardi, F. ; University of Colorado, Department of Electrical & Computer Engineering, Boulder, USA

In the letter, two algorithms for fault identification in diagnosable systems are presented. The order of time complexity for worst-case analysis is given: while the first algorithm executes in a sequential fashion in 0(n), where n is the number of units in the system, the second algorithm executes in 0(log2 n) in a binary tree arrangement. The algorithms are applicable to a diagnostic model with no invalidation.

Published in:

Electronics Letters  (Volume:21 ,  Issue: 9 )