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.

TextRef

B. Ramkumar and L.V. Kale, "Machine Independent AND and OR Parallel Execution
of Logic Programs Part I - the Binding Environment", IEEE Transactions on
Parallel and Distributed Systems, vol. 5, pp. 170-180, February 1994.