Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

A general algorithm for detecting faults under the comparison diagnosis model.

Stewart, I. A. (2010) 'A general algorithm for detecting faults under the comparison diagnosis model.', in 2010 IEEE International Symposium on Parallel and Distributed Processing IPDPS, 19-23 April 2010, Atlanta GA, ; proceedings. , pp. 1-9.

Abstract

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.

Item Type:Book chapter
Keywords:Interconnection networks, Fault diagnosis, Comparison diagnosis model.
Full text:PDF - Published Version (158Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1109/IPDPS.2010.5470369
Publisher statement:© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this (c) 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Record Created:18 Dec 2009 11:35
Last Modified:08 Nov 2010 12:03

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library