Fault-tolerant computing: theory and techniques; Vol. 2
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Performance of Fault-Tolerant Diagnostics in the Hypercube Systems
IEEE Transactions on Computers
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Evaluation of a Diagnosis Algorithm for Regular Structures
IEEE Transactions on Computers
Fault-diagnosis of grid structures
Theoretical Computer Science - Dependable computing
Diagnosability of regular systems
Journal of Algorithms
(t, k)-Diagnosable System: A Generalization of the PMC Models
IEEE Transactions on Computers
Reducing the Number of Sequential Diagnosis Iterations in Hypercubes
IEEE Transactions on Computers
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
Diagnosabilities of Regular Networks
IEEE Transactions on Parallel and Distributed Systems
A route-oriented self-diagnosis method for digital systems
Automation and Remote Control
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
On sequential diagnosis of multiprocessor systems
Discrete Applied Mathematics
A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM* model
Computers & Mathematics with Applications
Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
IEEE Transactions on Computers
On diagnosability of large multiprocessor networks
Discrete Applied Mathematics
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
One-step t-fault diagnosis for hypermesh optical interconnection multiprocessor systems
Journal of Systems and Software
On sequential diagnosis of multiprocessor systems
Discrete Applied Mathematics
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
Hi-index | 15.00 |
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 $\Omega \left( {N^{{{d \over {d+1}}}}} \right)$-diagnosable for any fixed d. For hypercubes, symmeteric log N-dimensional grid graphs, it is shown that our algorithm leads to a surprising $\Omega \left( {{{{N\,{\rm log\,log}\,N} \over {log\,N}}}} \right)$ degree of diagnosability. Next we show that the degree of diagnosability of an arbitrary interconnection graph by our algorithm is $\Omega \left( {\sqrt {{{N \over \Delta }}}} \right).$ This bound translates to an $\Omega \left( {\sqrt N} \right)$ degree of diagnosability for cube-connected cycles and an $\Omega \left( {\sqrt {{{N \over k}}}} \right)$ degree of diagnosability for k-ary trees. Finally, we augment our algorithm with another algorithm to show that every topology is $\Omega \left( {N^{{{1 \over 3}}}} \right)$-diagnosable.