Compiling prolog programs for parallel execution on a cellular machine

摘要

This paper investigates features of a PROLOG compiler for Mago's cellular machine. The compiler generates parallel FFP (Formal Functional Programming) code. Hence high efficiency in the execution of PROLOG programs can be achieved on this machine, owing to the almost unbounded parallelism it can accommodate.

rn

Techniques for implementing the parallel evaluation of the clauses of a relation (OR parallelism) are given. Problems in the exploitation of the parallel evaluation of a conjunction of goals (AND parallelism) are discussed. An FFP representation of the run-time environment of PROLOG is given. It is based on a previously published FFP implementation of unification. It allows matching of arguments through unification in linear time and space.