By Topic

A graph partitioning approach to sequential diagnosis

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

2 Author(s)
Khanna, S. ; Lucent Technol., AT&T Bell Labs., Murray Hill, NJ, USA ; Fuchs, W.K.

This paper describes a generalized sequential diagnosis algorithm whose analysis leads to strong diagnosability results for a variety of multiprocessor interconnection topologies. The overall complexity of this algorithm in terms of total testing and syndrome decoding time is linear in the number of edges in the interconnection graph and the total number of iterations of diagnosis and repair needed by the algorithm is bounded by the diameter of the interconnection graph. The degree of diagnosability of this algorithm for a given interconnection graph is shown to be directly related to a graph parameter which we refer to as the partition number. We approximate this graph parameter for several interconnection topologies and thereby obtain lower bounds on degree of diagnosability achieved by our algorithm on these topologies. If we let N denote total number of vertices in the interconnection graph and Δ denote the maximum degree of any vertex in it, then our results may be summarized as follows. We show that a symmetric d-dimensional grid graph is sequentially Ω(N[d/d+1])-diagnosable for any fixed d. For hypercubes, symmetric log N-dimensional grid graphs, it is shown that our algorithm leads to a surprising Ω([N log log N/log N]) degree of diagnosability. Next we show that the degree of diagnosability of an arbitrary interconnection graph by our algorithm is Ω(√N/Δ). This bound translates to an Ω(√N) degree of diagnosability for cube-connected cycles and an Ω(√N/k) degree of diagnosability for k-ary trees. Finally, we augment our algorithm with another algorithm to show that every topology is Ω(N1/3)-diagnosable

Published in:

Computers, IEEE Transactions on  (Volume:46 ,  Issue: 1 )