Thumbnail
Access Restriction
Subscribed

Author de Kergommeaux, Jacques Chassin ♦ Codognet, Philippe
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword AND-parallelism ♦ OR-parallelism ♦ Prolog ♦ Warren Abstract Machine ♦ Binding arrays ♦ Concurrent constraint programming ♦ Constraints ♦ Guard ♦ Hash windows ♦ Load balancing ♦ Massive parallelism ♦ Memory management ♦ Multisequential implementation techniques ♦ Nondeterminism ♦ Scheduling parallel tasks ♦ Static analysis
Abstract 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.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-09-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 26
Issue Number 3
Page Count 42
Starting Page 295
Ending Page 336


Open content in new tab

   Open content in new tab
Source: ACM Digital Library