A review of exploitation of AND-parallelism and combined AND/OR-parallelism in logic programs

Authors:
Kang Zhang
Affiliations:
Department of Computing, School of MPCE, Macquarie University, NSW 2109, Australia
Venue:
ACM SIGPLAN Notices
Year:
1994

Citing 28
Cited 0

Parallel execution of logic programs

Parallel execution of logic programs
A parallel execution model for logic programming

A parallel execution model for logic programming
Designing a high performance parallel logic programming system

ACM SIGARCH Computer Architecture News
Parallel logic programming in PARLOG: the language and its implementation

Parallel logic programming in PARLOG: the language and its implementation
Prolog multiprocessors

Prolog multiprocessors
The family of concurrent logic programming languages

ACM Computing Surveys (CSUR)
A technique for compiling execution graph expressions for restricted and-parallelism in logic programs

Proceedings of the 1st International Conference on Supercomputing
A compiling approach for exploiting AND-parallelism in logic programs

Future Generation Computer Systems - New generation computing
The DCG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism

Logic programming
Architected failure handling for and-parallel logic programs

Logic programming
Strand: new concepts in parallel programming

Strand: new concepts in parallel programming
Parallel logic programming

Parallel logic programming
Flexible scheduling of or-parallelism is Aurora: the Bristol scheduler

PARLE '91 Proceedings on Parallel architectures and languages Europe : volume II: parallel languages: volume II: parallel languages
Optimizing and-or parallel implementations

Proceedings of the 1990 North American conference on Logic programming
Joining AND parallel solutions in AND/OR parallel systems

Proceedings of the 1990 North American conference on Logic programming
Compile-time derivation of variable dependency using abstract interpretation

Journal of Logic Programming
Performance of the compiler-based Andorra-I system

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Implementing dynamic dependent And-parallelism

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Performance studies of a Prolog machine architecture

ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Concurrent PROLOG: Collected Papers

Concurrent PROLOG: Collected Papers
P-PROLOG: A Parallel Logic Programming Language

P-PROLOG: A Parallel Logic Programming Language
Delta Prolog: A Distributed Backtracking Extension with Events

Proceedings of the Third International Conference on Logic Programming
An Intelligent Backtracking Algorithm for Parallel Execution of Logic Programs

Proceedings of the Third International Conference on Logic Programming
An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs

Proceedings of the Third International Conference on Logic Programming
And-Or Parallelism in Full Prolog with Paged Binding Arrays

PARLE '92 Proceedings of the 4th International PARLE Conference on Parallel Architectures and Languages Europe
Reduction of Code Space in Parallel Logic Programming Systems

PARLE '91 Proceedings of Parallel Architectures and Languages - Volume II
A parallel execution model for prolog

A parallel execution model for prolog
Implementation of committed choice logic languages on shared memory multiprocessors

Implementation of committed choice logic languages on shared memory multiprocessors

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logic programs provide many opportunities for parallel execution. Among different forms of parallelism found in logic programs, AND-parallelism and OR-parallelism have shown to be most effective in speeding up the execution of logic programs. This paper offers a review of major activities in exploiting AND-parallelism and combined AND/OR-parallelism. Full version of this paper (23 pages) can be retrieved through anonymous ftp from ftp.mpce.mq.edu.au.