Flat parlog: a basis for comparison

Journal Article · Wed Apr 01 04:00:00 EST 1987 · Int. J. Parallel Program.; (United States)

DOI:https://doi.org/10.1007/BF01379097· OSTI ID:7077531

Foster, I; Taylor, S

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.

• Research Organization: Imperial College, London (England)
• OSTI ID: 7077531
• Journal Information: Int. J. Parallel Program.; (United States), Journal Name: Int. J. Parallel Program.; (United States) Vol. 16:2; ISSN IJPPE
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ARRAY PROCESSORS
COMPARATIVE EVALUATIONS
COMPUTER ARCHITECTURE
COMPUTER CODES
EFFICIENCY
MATHEMATICAL LOGIC
OPTIMIZATION
PARALLEL PROCESSING
PERFORMANCE TESTING
PROGRAMMING
PROGRAMMING LANGUAGES
TESTING