Abstract
Decreasing the time it takes an application to run is always an important concern. One of the ways to achieve this is through separating work in the application that need not be run sequentially onto two or more processors to be run in parallel. This work will take a look at an attempt to do this in one of the primary application areas of Artificial Intelligence, diagnosis.
Reiter's theory is presented for the diagnosis of faults from first principles, as well as a correction to the algorithm which defines the theory. An existing implementation of the theory is also discussed.
The constraint propagation inference mechanism used within the implementation is studied in detail. It is shown that attempts to apply a simple parallel bidirectional search to the inference mechanism did not increase its efficiency. A possible explanation for this and future directions to be explored are suggested.
Recommended Citation
Finlay, J. E. and Wilkerson, R. W., "Applying Parallel Bidirectional Search to a System for the Diagnosis of Faults" (1991). Computer Science Technical Reports. 124.
https://scholarsmine.mst.edu/comsci_techreports/124
Department(s)
Computer Science
Report Number
CSc-91-04
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1991 University of Missouri - Rolla, All rights reserved
Publication Date
1991-05-01
Comments
The first Author is a Graduate Student.
This report is substantially the M.S. thesis of the first author, completed May, 1991.