An approach for parallelizing OPS5 production systems and a faster match, C based indexing scheme for hypercube machines

An algorithm for reducing the amount of time spent by a production system in its MATCH phase is presented. The algorithm utilizes C language's arithmetic operations, which are not efficiently computed in standard production system languages, and also constricts the activity of the MATCH phase as performed in the OPS5 programming language. The parallelization is achieved by distributing the search amongst the nodes of a hypercube. The MATCH phase is an effort to satisfy the LHS (left hand side) of a PR (production rule) by the contents of a WM (working memory). C programming language was used for the implementation of the monkey-and-banana problem written in OPS5.<>