A technique for compiling execution graph expressions for restricted and-parallelism in logic programs

Abstract

An efficient model of and-parallel execution of logic programs has been described; this model is called the Restricted And-Parallelism model. It uses a compile-time data-dependence analysis to generate single execution graph expressions for the clauses in a Prolog program. These execution graph expressions use simple run-time tests to determine the possibilities of parallelism. An algorithm has been presented which automatically produces these execution graphs. The algorithm can be significantly improved by using the results of program-level data-dependence analysis; these improvements are currently the focus of additional research in this area.