A Memory Independent Binding Environment for AND and OR Parallel Execution of Logic Programs
| Laxmikant Kale | B. Ramkumar | Wennie Shu
International Conference on Logic Programming 1988
Publication Type: Paper
Repository URL:
Abstract
In pt.I, we presented a binding environment for the ANDand OR parallel execution of logic programs. This environment was instrumental inrendering a compiler for the AND and OR parallel execution of logic programs machineindependent. In this paper, we describe a compiler based on the Reduce-OR processmodel (ROPM) for the parallel execution of Prolog programs, and provide performance of the compiler on five parallel machines: the Encore Multimax, the Sequent Symmetry, the NCUBE 2, the Intel i860 hypercube and a network of Sun workstations. The compiler is part of a machine independent parallel Prolog development system built on top of a runtime environment for parallel programming called the Chare kernel, and runs unchanged on these multiprocessors. In keeping with the objectives behind the ROPM, the compilersupports both on and independent AND parallelism in Prolog programs and is suitable forexecution on both shared and nonshared memory machines. We discuss the performanceof the Prolog compiler in some detail and describe how grain size can be used to deliverperformance that is within 10% of the underlying sequential Prolog compiler on oneprocessor, and scale linearly with increasing number of processors on problems exhibiting sufficient parallelism. The loose coupling between parallel and sequential components makes it possible to use the best available sequential compiler as the sequential component of our compiler.
TextRef
L. V. Kale and B. Ramkumar and W. Shu, "A Memory Independent Binding Environment for AND and OR Parallel Execution of Logic Programs", The Joint International Conference/Symposium on Logic Programming, Seattle, WA, 1988, pp. 1223-1240.
People
Research Areas