Flat Parlog: A basis for comparison

DOI10.1007/BF01379097MaRDI QIDQ1099945zbMATH OpenOpenAlexWikidataFDO

Authors B. George

Publication date 1987

Published in International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01379097

zbMATH Keywords

Concurrent PrologFlat Parlogparallel logic programmingperformance evaluation

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Review text

Three similar parallel logic programming languages have been proposed; Parlog, Flat Concurrent Prolog, and Guarded Horn Clauses. Quantitative comparison of the languages has not previously been possible since they employ different execution models and implementation techniques. In order to uncover the effects of semantic differences on efficiency, a common basis is required for experimentation. This paper presents a subset of the language Parlog called Flat Parlog which provides a basis for quantitative comparison. The language combines the directional semantics of Parlog with the simple execution model of Flat Concurrent Prolog. A performance comparison between Flat Parlog and Flat Concurrent Prolog based on new implementations of both languages is presented. These new implementations are identical except for optimizations that are possible by virtue of semantic differences. Benchmark results indicate that Flat Parlog is more efficient; experiments have been able to quantify and explain this performance differential. A detailed description of the abstract machine for Flat Parlog is presented to illustrate the simplicity of the language.

Recommendations

• PARLOG: parallel programming in logic
• scientific article; zbMATH DE number 3997139
• A parallel implementation of flat concurrent Prolog
• OR-parallel PROLOG in flat concurrent PROLOG
• Parma—bridging the performance gap between imperative and logic programming

Cites work

• A parallel implementation of flat concurrent Prolog
• An abstract machine for the implementation of PARLOG on uniprocessors
• scientific article; zbMATH DE number 3958714 (Why is no real title available?)
• scientific article; zbMATH DE number 41233 (Why is no real title available?)
• PARLOG: parallel programming in logic

Cited in

(6)

• An abstract machine for the implementation of PARLOG on uniprocessors
• A parallel implementation of flat concurrent Prolog
• scientific article; zbMATH DE number 4060696 (Why is no real title available?)
• scientific article; zbMATH DE number 516984 (Why is no real title available?)
• scientific article; zbMATH DE number 1760138 (Why is no real title available?)
• scientific article; zbMATH DE number 3997139 (Why is no real title available?)

Describes a project that uses

Uses Software

• GHC
• PARLOG

This page was built for publication: Flat Parlog: A basis for comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099945)