Implementation of Production Systems on Message-Passing Computers

The authors examine the suitability of message-passing computers for parallel implementations of production systems. Two mappings for production systems on these computers, one targeted toward fine-grained message-passing machines and the other targeted toward medium-grained machines, are presented. Simulation results for the medium-grained mapping are presented, and it is shown that it is possible to exploit the available parallelism and to obtain reasonable speedups. The authors perform a detailed analysis of the results and suggest solutions for some of the problems. >

[1]  A. Newell.  Unified Theories of Cognition , 1990 .

[2]  Daniel P. Miranker.  TREAT: A new and efficient match algorithm for AI production systems , 1988 .

[3]  Charles L. Seitz,et al.  Multicomputers: message-passing concurrent computers , 1988, Computer.

[4]  Milind Tambe,et al.  Production Systems on Message Passing Computers: Simulation Results and Analysis , 1989, ICPP.

[5]  Salvatore J. Stolfo,et al.  Towards the Parallel Execution of Rules in Production System Programs , 1985, ICPP.

[6]  Kemal Oflazer,et al.  Partitioning in parallel processing of production systems , 1987 .

[7]  Allen Newell,et al.  The logic theory machine-A complex information processing system , 1956, IRE Trans. Inf. Theory.

[8]  Allen Newell,et al.  Parallel OPS5 User's Manual , 1988 .

[9]  Nancy Martin,et al.  Programming Expert Systems in OPS5 - An Introduction to Rule-Based Programming(1) , 1985, Int. CMG Conference.

[10]  Gerhard Zimmermann,et al.  PESA I-A Parallel Architecture for Production Systems , 1987, ICPP.

[11]  Salvatore J. Stolfo,et al.  Initial Performance of the DADO2 Prototype , 1987, Computer.

[12]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[13]  Allen Newell,et al.  Soar/PSM-E: investigating match parallelism in a learning production sytsem , 1988, PPEALS '88.

[14]  John P. McDermott,et al.  R1 Revisited: Four Years in the Trenches , 1984, AI Mag..

[15]  H. T. Kung,et al.  The design of nectar: a network backplane for heterogeneous multicomputers , 1989, ASPLOS III.

[16]  Daniel P. Miranker.  TREAT: a better match algorithm for AI production systems , 1987, AAAI 1987.

[17]  Daniel P. Siewiorek,et al.  WEAVER: A Knowledge-Based Routing Expert , 1985, IEEE Design & Test of Computers.

[18]  Jennifer Widom,et al.  Deriving Production Rules for Constraint Maintainance , 1990, VLDB.

[19]  李幼升,et al.  Ph , 1989 .

[20]  John P. McDermott,et al.  R1: A Rule-Based Configurer of Computer Systems , 1982, Artif. Intell..

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Kai Hwang,et al.  A simulated annealing method for mapping production systems onto multicomputers , 1990, Sixth Conference on Artificial Intelligence for Applications.

[23]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[24]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[25]  Charles L. Forgy,et al.  The OPS83 report , 1984 .

[26]  Dan I. Moldovan.  RUBIC: a multiprocessor for rule-based systems , 1989, IEEE Trans. Syst. Man Cybern..

[27]  Andrew A. Chien,et al.  J-machine: A fine-grain concurrent computer , 1989 .

[28]  Allen Newell,et al.  The effectiveness of task-level parallelism for high-level vision , 1989, PPOPP '90.

[29]  John P. McDermott,et al.  Rule-Based Interpretation of Aerial Imagery , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[30]  Allen Newell,et al.  Parallel OPS5 on the Encore Multimax , 1988, ICPP.

[31]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[32]  Michael Hucka,et al.  Learning in Tele-autonomous Systems using Soar , 1989 .

[33]  William J. Dally,et al.  A VLSI Architecture for Concurrent Data Structures , 1987 .

[34]  H. T. Kung,et al.  The design of nectar: a network backplane for heterogeneous multicomputers , 1989, ASPLOS 1989.

[35]  Andrew A. Chien,et al.  Architecture of a message-driven processor , 1987, ISCA '87.

[36]  J. O. Urmson,et al.  The William James Lectures , 1963 .

[37]  Donald W. Bouldin,et al.  Parallel architecture for OPS5 , 1988, ISCA '88.

[38]  Anoop Gupta.  Parallelism in production systems , 1987 .

[39]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

[40]  Anoop Gupta,et al.  Suitability of Message Passing Computers for Implementing Production Systems , 1988, AAAI.

[41]  Anoop Gupta,et al.  Exploiting variable grain parallelism at runtime , 1988, PPoPP 1988.

[42]  Allen Newell,et al.  Soar/PSM-E: investigating match parallelism in a learning production sytsem , 1988, PPoPP 1988.

[43]  Daniel P. Siewiorek,et al.  WEAVER: A Knowledge-Based Routing Expert , 1986 .

[44]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..