ACM Home Page
Please provide us with feedback. Feedback
High-speed implementations of rule-based systems
Full text PdfPdf (2.33 MB)
Source ACM Transactions on Computer Systems (TOCS) archive
Volume 7 ,  Issue 2  (May 1989) table of contents
Pages: 119 - 146  
Year of Publication: 1989
ISSN:0734-2071
Authors
A. Gupta  Stanford Univ., Stanford, CA
C. Forgy  Carnegie-Mellon Univ., Pittsburgh, PA
A. Newell  Carnegie-Mellon Univ., Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 95,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/63404.63405
What is a DOI?

ABSTRACT

Rule-based systems are widely used in artificial intelligence for modeling intelligent behavior and building expert systems. Most rule-based programs, however, are extremely computation intensive and run quite slowly. The slow speed of execution has prohibited the use of rule-based systems in domains requiring high performance and real-time response. In this paper we explore various methods for speeding up the execution of rule-based systems. In particular, we examine the role of parallelism in the high-speed execution of rule-based systems and study the architectural issues in the design of computers for rule-based systems. Our results show that contrary to initial expectations, the speed-up that can be obtained from parallelism is quite limited, only about tenfold. The reasons for the small speed-up are: (1) the small number of rules relevant to each change to data memory; (2) the large variation in the processing requirements of relevant rules; and (3) the small number of changes made to data memory between synchronization steps. Furthermore, we observe that to obtain this limited factor of tenfold speed-up, it is necessary to exploit parallelism at a very fine granularity. We propose that a suitable architecture to exploit such fine-grain parallelism is a shared-memory multiprocessor with 32-64 processors. Using such a multiprocessor, it is possible to obtain execution speeds of about 3800 rule-firings/set. This speed is significantly higher than that obtained by other proposed parallel implementations of rule-based systems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
BROOKS, R., AND LUM, R. Yes, an SIMD machine can be used for AI. In International Joint Conference on Artificial Intelligence (Los Angeles, Aug. 1985), pp. 73-79.
 
4
 
5
FORGY, C., GUPTA, A., NEWELL, A., AND WEDIG, R. Initial assessment of architectures for production systems. In National Conference for Artificial Intelligence (Austin, Tex., Aug. 1984). AAAI- 1984, pp. 116-120.
 
6
FORGY, C. L. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artif. Intell. 19, 1 (Sept. 1982), 17-37.
 
7
FORGV, C. L. The 0PS83 Report. Tech. Rep. CMU-CS-84-133, Carnegie-Mellon Univ., Pittsburgh, May 1984.
 
8
GRIESMER, J. H., HONG, S. J., KARNAUGH, M., KASTNER, J. K., SCHOR, M. I., ENNIS, R. L., KLEIN, D. A., MILLIKEN, K. R., AND VAN WOERKOM, I-~. M. YES/MVS: A continuous real time expert system. In National Conference on Artificial Intelligence (Austin, Tex., Aug. 1984). AAAI- 1984, pp. 130-136.
 
9
GUeTA, A. Implementing OPS5 production systems on DADO. In International Conference on Parallel Processing. IEEE, New York, 1984, pp. 83-91.
 
10
 
11
GUPTA, A., AND TAMBE, M. Suitability of message passing computers for implementing production systems. In National Conference on Artificial Intelligence (St. Paul, Minn., Aug. 1988). AAAI- 88, pp. 687-692.
 
12
HALEY, P., KOWALSKI, J., MCDERMOTT, J., AND McWHORTER, R. PTRANS: A rule-based management assistant. Tech. Rep., Carnegie-Mellon Univ., Pittsburgh, 1983.
 
13
HENNESSY, J. L., JouPPI, N., PRZYBYLSKI, S., ROWEN, C., AND GROSS, T. The MIPS machine. In Computer Conference, (Feb. 1982).
14
 
15
HILLYER, B. K., AND SHAW, D. E. Execution of OPS5 production systems on a massively parallel machine. Tech. Rep., Columbia Univ., Sept. 1984.
 
16
IRANI, K. B., AND ONVUKSEL, I. H. A closed-form solution for the performance analysis of multiple-bus multiprocessor systems. IEEE Trans. Comput. C-33, 11 (Nov. i984), 1004-1012.
 
17
KAHN~ G., AND McDERMOTT, J. The MUD system. In First Conference on Artificial Intelligence Applications, IEEE Computer Society and AAAI, Dec. 1984.
 
18
KATSUKi D., ET AL. Pluribus--An operational fault-tolerant multiprocessor. Proc. IEEE 66, 10 (Oct. 1978).
19
 
20
KIM, J., MCDERMOTT, J., AND SIEWlOREK, D. TALIB: A knowledge-based system for IC layout design, in National Conference on Artificial Intelligence (Washington, D.C., Aug. 1983). AAAI- 1983, pp. 197-201.
 
21
 
22
 
23
LAIRD, J. E. Soar User's Manual. (4th ed.) Xerox PARC, 1986.
 
24
LEHR, T. F. The implementation of a production system machine. In Hawaii International Conference on System Sciences (Honolulu, Jan. 1986), pp. 177-186.
 
25
MARCUS, S., MCDERMOTT, J., ROCHE, R., THOMPSON, T., WANG, T. AND WOOD, G. Design Document for VT. Carnegie-Mellon Univ., Pittsburgh, 1984.
 
26
MCDERMOTT, J. RI: A rule-based configurer of computer systems. Tech. Rep. CMU-CS-80-119, Carnegie-Mellon Univ,, Pittsburgh, April 1980.
 
27
MCDERMOTT, J. RI: A rule-based configurer of computer systems. Artif. Intell. 19, 1 (1982), 39-88.
 
28
MCDERMOTT, J. XSEL: A computer salesperson's assistant. In Machine intelligence, D. Michie, J. E. Hayes, and Y. H. Pao, eds., Horwood, 1982.
 
29
MmANKER, D. P. TREAT: A new and efficient match algorithm for AI production systems. Ph.D. dissertation, Columbia Univ., New York, Jan. 1987.
 
30
NAYAK, P., GUPTA, A., AND ROSENBLOOM, P. Comparison of the Rete and Treat production matchers for SOAR: A summary. In National Conference on Artificial Intelligence (St. Paul, Minn., Aug. 1988). AAAI-88, pp. 693-698.
 
31
NEWELL, A. HARPY, production systems and human cognition. Tech. Rep. CMU-CS-78-140, Carnegie-Mellon Univ., Pittsburgh, Sept. 1978.
 
32
 
33
OFLAZER, K. Parallel execution of production systems. In International Conference on Parallel Processing (Aug. 1984). IEEE, New York, 1984, pp. 92-100.
 
34
 
35
PATTERSON, D. A., AND SEQUIN, C. H. A VLSI RISC. Computer 9 (1982).
 
36
QUINLAN, J. A comparative analysis of computer architectures for production system machines. In Hawaii International Conference on System Sciences (Honolulu, Jan. 1986), pp. 194-200.
 
37
RADIN, G. The 801 minicomputer, IBM J. Res. Dev. 27 (May 1983).
 
38
REED, B., JR. The ASPRO parallel inference engine (P.I.E.): A real time production rule system. Goodyear Aerospace, 1985.
 
39
 
40
ROSENBLOOM, P. S., LAIRD, J. E., MCDERMOTT, J., NEWELL, A., AND ORCIUCH, E. R1-Soar: An experiment in knowledge-intensive programming in a problem-solving architecture. In IEEE Workshop on Principles of Knowledge Based Systems, 1984.
41
 
42
SCHREINER, F., AND ZIMMERMAN, G. Pesa-l--A parallel architecture for production systems. In International Conference on Parallel Processing (Pheasant Run, Ill., Aug. 1987), pp. 166-169.
 
43
SHAW, D. E. NON-VON's applicability to three AI task areas. In International Joint Conference on Artificial Intelligence (Los Angeles, Aug. 1985), pp. 61-72.
 
44
STOLFO, S. J. Five parallel algorithms for production system execution on the DADO machine. In National Conference on Artificial Intelligence (Austin, Tex., Aug. 1984). AAAI-1984, pp. 300-307.
 
45
STOLFO, S. J., AND SHAW, D. E. DADO: A tree-structured machine architecture for production systems. In National Conference on Artificial Intelligence (Pittsburgh, Pa., Aug. 1982). AAAI- 1982, pp. 242-246.
 
46
TALUKDAR, S. i., CARDOZO, E., LEAO, L., BANARES, R., AND JOOBBANI, R. A system for distributed problem solving. In Workshop on Coupling Symbolic and Numerical Computing in Expert Systems (Aug. 1985).
 
47
TENORIO, M. F. M., AND MOLDOVAN, D. |. Mapping production systems in multiprocessors. In International Conference on Parallel Processing (Pheasant Run, Ill., Aug. 1985). IEEE, New York, 1985, pp. 56-62.
48
 
49
50

CITED BY  9