The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1992 vol.41)
pp: 606-615
ABSTRACT
<p>A practical model for probabilistic fault diagnosis is presented. Unlike PMC-based models, the model allows testers to conduct multiple tests on the same processor. This allows the design of efficient probabilistic diagnosis algorithms with good asymptotic behavior, with minimal constraints on the connection structure of the multiprocessor system, in contrast to other deterministic and probabilistic approaches. In practical cases, the number of immediate neighbors of any processor need be no greater than two, which implies that the algorithm can be applied to any practical homogeneous parallel architecture. It is also shown how to make efficient use of tests by allowing the number of testing processors, and the number of tests performed by a processor to be traded off in achieving asymptotically accurate diagnosis.</p>
INDEX TERMS
parallel computers; probabilistic fault diagnosis; multiple tests; probabilistic diagnosis algorithms; asymptotic behavior; multiprocessor system; immediate neighbors; homogeneous parallel architecture; testing processors; fault tolerant computing; parallel algorithms; parallel architectures; parallel machines; probability.
CITATION
S. Rangarajan, D. Fussell, "Diagnosing Arbitrarily Connected Parallel Computers with High Probability", IEEE Transactions on Computers, vol.41, no. 5, pp. 606-615, May 1992, doi:10.1109/12.142687
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool