E1AR0002@SMUVM1.BITNET (Leff, Southern Methodist University) (10/19/87)
Restricted And-Parallelism for Logic Programs
SPEAKER: Doug DeGroot LOCATION: 315 SIC Southern Methodist University
Texas Instruments Inc. TIME: 1:30 pm
ABSTRACT
A number of parallel execution models have been proposed for the
highly-parallel execution of logic programs. Most of these center on
various forms of and-parallelism and/or or-parallelism. While the
majority of work in Europe and Japan seems to have focused on
or-parallel models, research in the United States had focused more on
and-parallelism. Some of the reasons for this will be examined, and a
number of models for and-parallelism and related research will be
mentioned. Then a specific model, called Restricted And-Parallelism
(RAP) will be described in detail. The discussion will focus on the
model itself, techniques for the automatic compilation of Prolog
programs into RAP graph expressions, and the proper handling of
side-effects in a parallel execution environment, and global
data-dependency analysis for better program decomposition. An overview
of RAP-related research efforts in other parts of the world will also
be discussed. Finally, topics for future research will be discussed as
time permits.