Compiling OR-parallelism into AND-parallelism

Michael Codish, Ehud Shapiro

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

This paper suggests a general method for compiling OR-parallelism into AND-parallelism. An interpreter for an AND/OR-parallel language written in the AND-parallel subset of the language induces a source-to-source transformation from the full language into the AND-parallel subset. This transformation can be identified and implemented as a special purpose compiler or applied using a general purpose partial evaluator. The method is demonstrated to compile a variant of Concurrent Prolog into an AND-parallel subset of the language called Flat Concurrent Prolog (FCP). It is also shown applicable to the compilation of OR-parallel Prolog to FCP. The transformation identified is simple and efficient. The performance of the method is discussed in the context of programming examples. These compare well with conventionally compiled Prolog programs.

Original languageEnglish
Title of host publication3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings
EditorsEhud Shapiro
PublisherSpringer Verlag
Pages283-297
Number of pages15
ISBN (Print)9783540164920
DOIs
StatePublished - 1 Jan 1986
Externally publishedYes
Event3rd International Conference on Logic Programming, ICLP 1986 - London, United Kingdom
Duration: 14 Jul 198618 Jul 1986

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume225 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Logic Programming, ICLP 1986
Country/TerritoryUnited Kingdom
CityLondon
Period14/07/8618/07/86

Fingerprint

Dive into the research topics of 'Compiling OR-parallelism into AND-parallelism'. Together they form a unique fingerprint.

Cite this