Machine independent AND and OR parallel execution of logic programs. I. The binding environment

Author

Ramkumar, Balkrishna ; Kalé, Laxmikant V.

Author_Institution

Dept. of Electr. & Comput. Eng., Iowa Univ., Iowa City, IA, USA

Volume

5

Issue

2

fYear

1994

fDate

2/1/1994 12:00:00 AM

Firstpage

170

Lastpage

180

Abstract

We describe a binding environment for the AND and OR parallel execution of logic programs that is suitable for both shared and nonshared memory multiprocessors. The binding environment was designed with a view of rendering a compiler using this binding environment machine independent. The binding environment is similar to closed environments proposed by J. Conery. However, unlike Conery´s scheme, it supports OR and 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

Keywords

logic programming; multiprocessing systems; parallel programming; Chare Kernel; binding environment; compiler; logic programs; nonshared memory multiprocessors; parallel execution; shared memory multiprocessors; Computer languages; Hypercubes; Kernel; Logic programming; Parallel languages; Parallel machines; Parallel processing; Parallel programming; Program processors; Random access memory;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.265944

Filename

265944