PARALLEL LOGIC PROGRAMMING SYSTEMS

doi:10.1145/185403.185453

Return

PARALLEL LOGIC PROGRAMMING SYSTEMS

1994-09-01

DEKERGOMMEAUX, JC *

CODOGNET, P

DOI：10.1145/185403.185453

Original

Save

View PDF

Abstract

En 中文

Parallelizing logic programming has attracted much interest in the research community, because of the intrinsic OR- and AND-parallelisms of logic programs. One research stream aims at transparent exploitation of parallelism in existing logic programming languages such as Prolog, while the family of concurrent logic languages develops language constructs allowing programmers to express the concurrency-that is, the communication and synchronization between parallel processes-within their algorithms. This article concentrates mainly on transparent exploitation of parallelism and surveys the most mature solutions to the problems to be solved in order to obtain efficient implementations. These solutions have been implemented, and the most efficient parallel logic programming systems reach effective speedups over state-of-the-art sequential Prolog implementations. The article also addresses current and prospective research issues in extending the applicability and the efficiency of existing systems, such as models merging the transparent parallelism and the concurrent logic languages approaches, combination of constraint logic programming with parallelism, and use of highly parallel architectures.

Keywords:

AND-PARALLELISM

BINDING ARRAYS

CONCURRENT CONSTRAINT PROGRAMMING

CONSTRAINTS

GUARD, HASH WINDOWS

LOAD BALANCING

MASSIVE PARALLELISM

MEMORY MANAGEMENT

MULTISEQUENTIAL IMPLEMENTATION TECHNIQUES

NONDETERMINISM

OR-PARALLELISM

PROLOG

SCHEDULING PARALLEL TASKS

STATIC ANALYSIS

WARREN ABSTRACT MACHINE

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.