Machine Independent AND and OR Parallel Execution of Logic Programs: Part I-The Binding Environment

Authors:
B. Ramkumar;L. V. Kalé
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 6
Cited 4

Prolog multiprocessors

Prolog multiprocessors
Or-parallel execution models of prolog

II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Joining AND parallel solutions in AND/OR parallel systems

Proceedings of the 1990 North American conference on Logic programming
On criteria for or-parallel execution models of logic programs

Proceedings of the 1990 North American conference on Logic programming
The and/or process model for parallel interpretation of logic programs

The and/or process model for parallel interpretation of logic programs
An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel

An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel

Parallel execution of prolog programs: a survey

ACM Transactions on Programming Languages and Systems (TOPLAS)
Machine Independent AND and OR Parallel Execution of Logic Programs: Part II-Compiled Execution

IEEE Transactions on Parallel and Distributed Systems
Backtracking in Independent And-Parallel Implementations of Logic Programming Languages

IEEE Transactions on Parallel and Distributed Systems
Regular Paper: Load-Balanced Drift-Diffusion Model Simulation: Cluster Software Performance Evaluation

International Journal of High Performance Computing Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a binding environment for the AND and OR parallel execution of logicprograms that is suitable for both shared and nonshared memory multiprocessors. Thebinding environment was designed with a view of rendering a compiler using this bindingenvironment machine independent. The binding environment is similar to closedenvironments proposed by J. Conery. However, unlike Conery's scheme, it supports ORand independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel.