Programming techniques for efficiently exploiting parallelism in logic programming languages

Authors:
E. Tick;N. Ichiyoshi
Affiliations:
University of Oregon, Dept. of Computer Science, Eugene, OR;ICOT, Mita Kokusai Bldg 21F, 1-4-28, Mita, Minta-ku, Tokyo 108
Venue:
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Year:
1990

Citing 2
Cited 1

Prolog programming for artificial intelligence

Prolog programming for artificial intelligence
Implementation of committed choice logic languages on shared memory multiprocessors

Implementation of committed choice logic languages on shared memory multiprocessors

Agent-oriented programming: from prolog to guarded definite clauses

Agent-oriented programming: from prolog to guarded definite clauses

Quantified Score

Hi-index	0.01

Visualization

Abstract

Granularity collecting (e.g., in OR-parallel Prolog) and removal of synchronization points (e.g., in AND-parallel committed-choice languages), are in general useful techniques for speeding up parallel logic programs. In this paper we explain these techniques with a unifying example: the Semigroup Problem, the calculation of the members of a semigroup given an initial set of generators. Performance measurements on a Sequent Symmetry multiprocessor are presented as evidence of the utility of the paradigms.