An Abstract Machine for the Reduce-OR Process Model for Parallel Prolog

We discuss the design of an abstract machine for the Reduce-OR process model (ROPM) for the AND and OR parallel execution of Prolog programs. It differs from the WAM in many respects, and some of these differences are elaborated upon in this paper. Some of the significant differences are related to the binding environment which has been designed to support AND and OR parallel execution of logic programs on both shared and nonshared memory machines, the process model, and the handling of solutions for AND parallel branches in the Data Join Graph (DJG) that is used to represent data dependencies in a Prolog clause. An emulator for the abstract machine has been implemented and is targeted for both shared and nonshared memory machines.

[1]  Manuel V. Hermenegildo,et al.  An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel , 1986 .

[2]  Shyam Mudambi.  Performance Analysis of Aurora on a Switch-Based Multiprocessor , 1989, NACLP.

[3]  Laxmikant V. Kalé,et al.  'Completeness' and 'Full Parallelism' of Parallel Logic Programming Schemes , 1987, SLP.

[4]  Jacques Chassin de Kergommeaux,et al.  An Abstract Machine to Implement OR-AND Parallel Prolog Efficiently , 1990, J. Log. Program..

[5]  Seif Haridi,et al.  OR-Parallel Prolog Made Efficient on Shared Memory Multiprocessors , 1987, SLP.

[6]  Laxmikant V. Kalé,et al.  The Reduce-Or Process Model for Parallel Execution of Logic Programs , 1991, J. Log. Program..

[7]  Gopal Gupta,et al.  Combined And-Or Parallelism on Shared Memory Multiprocessors , 1989, NACLP.

[8]  Vipin Kumar,et al.  Performance of And-Paralle Execution of Logic Programs on a Shared-Memory Multiprocessor , 1988, FGCS.

[9]  Doug DeGroot,et al.  Restricted AND-Parallelism , 1984, FGCS.

[10]  Laxmikant V. Kalé,et al.  A Memory Organization Independent Binding Environment for AND and OR Parallel Execution of Logic Programs , 1988, ICLP/SLP.

[11]  David Y. Y. Yun,et al.  A Scalable Abstract Machine Model to Support Limited-OR (LOR) / Restricted-AND Parallelism (RAP) in Logic Programs , 1988, ICLP/SLP.

[12]  Laxmikant V. Kalé,et al.  Compiled Execution of the Reduce-OR Process Model on Multiprocessors , 1989, NACLP.