A general algorithm for detecting faults under the comparison diagnosis model

We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty processors. In particular, we prove that if the underlying graph G = (V, E) forming the interconnection network has connectivity no less than its diagnosability and can be partitioned into enough connected components of large enough size then given a syndrome of test results under the comparison diagnosis model resulting from some set of faulty nodes of size at most , we can find the actual set of faulty nodes with time complexity O(N), where is the maximal degree of any node of the graph and N is the number of nodes.

• Type: Journal
• Year: 2010
• Where: IPPS
• Authors: Iain A. Stewart
• Keywords: Certain Distributed-memory Multiprocessor, Distributed And Parallel Computing, Faulty Nodes, Faulty Processors, IPPS 2010