article

Free access

Programming techniques for efficiently exploiting parallelism in logic programming languages

Authors:

E. Tick,

N. IchiyoshiAuthors Info & Claims

ACM SIGPLAN Notices, Volume 25, Issue 3

Pages 31 - 39

https://doi.org/10.1145/99164.99168

Published: 01 February 1990 Publication History

PDF eReader

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.

References

[1]

I. Bratko. Prolog Programming for Artificial Intelligence. Addison-Wesley Ltd., Wokingham, England, 1986.

Digital Library

Google Scholar

[2]

J. Crammond. Implementation of Committed- Choice Logic Languages on Shared-Memory Multiprocessors. PhD thesis, Heriot-Watt University, Endinburgh, May 1988.

Digital Library

Google Scholar

[3]

T. Disz, E. Lusk, and R. Overbeek. Experiments with Ol%Parallel Logic Programs. In Fourth International Conference on Logic Programming, pages 576-600. University of Melbourne, MIT Press, May 1987.

Google Scholar

[4]

E. Lusk et al. The Aurora Or-Parallel Prolog System. In International Conference on Fifth Generation Computer Systems, pages 819-830. Tokyo, November 1988.

Google Scholar

[5]

M. Sato and et al. KL1 Execution Model for PIM Cluster with Shared Memory. In Fourth Internalional Conference on Logic Programming, pages 338-355. University of Melbourne, MIT Press, May 1987.

Google Scholar

[6]

Sequent Computer Systems, Inc. Sequent Guide #o Parallel Programming. 15450 SW Koll Parkway, Beaverton OR 97006, 1987.

Google Scholar

[7]

S. Takagi. A Collection of KL1 Programs- Part I. Technical Memo TM-311, ICOT, Tokyo, May 1987.

Google Scholar

[8]

E. Tick. Exeriences Programming Parallel Logic. Technical report, University of Tokyo, October 1989. To be published.

Google Scholar

Index Terms

Programming techniques for efficiently exploiting parallelism in logic programming languages

Recommendations

Exploiting Implicit Parallelism in Dynamic Array Programming Languages
ARRAY'14: Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming

We have built an interpreter for the array programming language J. The interpreter exploits implicit data parallelism in the language to achieve good parallel speedups on a variety of benchmark applications.

Many array programming languages operate on ...
Programming techniques for efficiently exploiting parallelism in logic programming languages
PPOPP '90: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming

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 ...
Exploiting path parallelism in logic programming
PDP '95: Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing

This paper presents a novel parallel implementation of Prolog. The system is based on Multipath, a novel execution model for Prolog that implements a partial breadth-first search of the SLD-tree. The paper focusses on the type of parallelism inherent to ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 25, Issue 3

Mar. 1990

216 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/99164

Editor:
David Padua
Univ. of Illinois at Urbana/Champaign, Urbana

Issue’s Table of Contents

PPOPP '90: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
February 1990
206 pages
ISBN:0897913507
DOI:10.1145/99163
Chairman:
David Padua
Univ. of Illinois at Urbana/Champaign, Urbana

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1990

Published in SIGPLAN Volume 25, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
403
Total Downloads

Downloads (Last 12 months)130
Downloads (Last 6 weeks)14

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Index Terms

Recommendations

Exploiting Implicit Parallelism in Dynamic Array Programming Languages