Abstract
We describe a parallel implementation of a subset of the EQUIP expert system. In EQUIP, diagnostic reasoning is applied to the domain of silicon chip production control. In order to diagnose all probable process faults that occurred in the manufacturing of IC's, the necessary computations in the inference part of the program become very time-consuming. To reduce this computation time, a parallel inference algorithm has been developed. We describe this inference algorithm and its parallel implementation in POOL-X. In the end some results will be shown using a multi-node computer.
The work described in this document was conducted at the Centre for Mathematics and Computer Science (CWI) in Amsterdam as part of the PRISMA project, a joint effort with Philips Research Eindhoven, partially supported by the Dutch “Stimulerings-projectteam Informatica-onderzoek” (SPIN).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H.J. Ter Horst (1990). Paper on EQUIP, Philips Research Laboratories Eindhoven, The Netherlands, to appear.
J.W. Spee (1990). Finding All Minimal Covers of a Set Using Implicit Enumeration, technical report of the Centre for Mathematics and Computer Science CS-R9007, Department of Software Technology, The Netherlands.
J.W. Spee (1989). A Parallel Implementation of a Part of EQUIP in POOL2, PRISMA doc. nr. P0459, Philips Research Laboratories Eindhoven, The Netherlands.
J.W. Spee (1989). A Dynamic Load Balancing Strategy for POOL Programs, PRISMA doc. no. P0464, Philips Research Laboratories Eindhoven, The Netherlands.
P. America (1989). Language Definition of POOL-X, PRISMA doc. nr. P0350, Philips Research Laboratories Eindhoven, The Netherlands.
P. America, L. Augusteijn, B, Hulshof, (1990), Annotations for Data Object Support in POOL-X, POOMA doc. nr. 0019, Philips Research Laboratories Eindhoven, The Netherlands.
P. America (1988). Definition of POOL2, a parallel object-oriented language, Esprit 415A, doc. nr. 364.
M. Beemster (1990), POOL±X, PRISMA doc. nr. P0522, Philips Research Laboratories Eindhoven, The Netherlands.
Y. Peng (1986). A Formalization of Parsimonious Covering and Probabilistic Reasoning in Abductive Diagnostic Inference, Ph.-D. Thesis, Department of Computer Science, TR-1615, University of Maryland.
J.A. Reggia, D.S. Nau, P.Y. Wang (1985). A Formal Model of Diagnostic Inference I. Information Sciences, vol. 37, pp. 227–256.
J.A. Reggia, D.S. Nau, P.Y. Wang (1985). A Formal Model of Diagnostic Inference II. Information Sciences, vol. 37, pp. 257–285.
A.M. Geoffrion (1967). Integer Programming by Implicit Enumeration and Balas' Method, SIAM Review, Vol. 9, No. 2, pp. 178–190.
N. Christofides (1975). Graph Theory, An Algorithmic Approach, Academic Press, New York, pp. 30–57.
C.E. Lemke, H.M. Salkin, K. Spielberg (1971). Set Covering by Single Branch Enumeration with Linear-Programming Subproblems, Operations Research, vol. 19, pp. 998–1022.
R. Garfinkel, G.L. Nemhauser (1972). Integer Programming, John Wiley & Sons, New York. Class of Set-Covering Algorithms, SIAM Journal of Computing, Vol. 12, No. 2, pp. 329–346.
V. Lifschitz, B. Pittel (1983). The Worst and the Most-Probable Performance of a Class of Set-Covering Algorithms, SIAM Journal of Computing, Vol. 12, No. 2, pp. 329–346.
M.H. Young, S. Muroga (1985). Minimal Covering Problem and PLA Minimization, International Journal of Computer and Information Sciences, Vol. 14, No. 6, pp. 337–364.
F. Sijstermans & J.M. Jansen (1988). Parallel branch-and bound algorithms, Esprit 415A doc. nr. 413.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spee, J.W. (1991). A parallel implementation of the EQUIP expert system. In: America, P. (eds) Parallel Database Systems. PDS 1990. Lecture Notes in Computer Science, vol 503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54132-2_63
Download citation
DOI: https://doi.org/10.1007/3-540-54132-2_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54132-5
Online ISBN: 978-3-540-47432-6
eBook Packages: Springer Book Archive