Compiling OR-parallelism into AND-parallelism

Codish, Michael; Shapiro, Ehud

doi:10.1007/3-540-16492-8_82

Cited by 23 publications

(6 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The differences in performance are examined and their causes in terms of language differences are explained. As pointed out by Takeuchi and Furukawa,15) Flat Parlog is essentially equivalent to Flat GHC; thus the results presented also apply to this language. The paper also presents a detailed description of the Flat Parlog abstract machine which has been benchmarked.…”

Section: Introductionsupporting

confidence: 58%

Flat Parlog: A basis for comparison

Foster

Taylor

1987

Int J Parallel Prog

View full text Add to dashboard Cite

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

show abstract

Section: Introductionsupporting

confidence: 58%

Flat Parlog: A basis for comparison

Foster

Taylor

1987

Int J Parallel Prog

View full text Add to dashboard Cite

show abstract

“…Venken described a partial evaluator for Prolog in Prolog [52], as did Takeuchi and Furukawa, who applied theirs to the specialization of meta programs as suggested above [48]. Both were examples of autoprojectors, as was Safra and Shapiro's partial evaluator for Concurrent Prolog [43], one use of which was the transformation described in Codish and Shapiro [9].…”

Section: Historical Notesmentioning

confidence: 96%

Mix: A self-applicable partial evaluator for experiments in compiler generation

Jones

Sestoft

Søndergaard

1989

Lisp and Symbolic Computation

197

View full text Add to dashboard Cite

Abstract, The program transformation principle called partial evaluation has interesting applications in compilation and compiler generation. Self-applicable partial evaluators may be used for transforming interpreters into corresponding compilers and even for the generation of compiler generators. This is useful because interpreters are significantly easier to write than compilers, but run much slower than compiled code. A major difficulty in writing compilers (and compiler generators) is the thinking in terms of distinct binding times: run time and compile time (and compiler generation time). The paper gives an introduction to partial evaluation and describes a fully automatic though experimental partial evaluator, called mix, able to generate stand-alone compilers as well as a compiler generator. Mix partially evaluates programs written in Mixwell, essentially a first-order subset of statically scoped pure Lisp. For compiler generation purposes it is necessary that the partial evaluator be self-applicable. Even though the potential utility of a self-applicable partial evaluator has been recognized since 1971, a 1984 version of mix appears to be the first successful implementation. The overall structure of mix and the basic ideas behind its way of working are sketched. Finally, some results of using a version of mix are reported.Since the early 1970s it has been k n o w n that in theory, the p r o g r a m transformation principle called partial evaluation can be used for compiling and compiler generation, and even for the a u t o m a t i c generation o f a compiler generator. A partial evaluator able to generate stand-alone compilers and compiler generators had not, however, been successfully implemented before 1984 when the first mix system was brought to work at the University o f Copenhagen.In this paper we discuss partial evaluation and its applications to compiler generation and sketch the partial evaluator we developed, called the mix system. The results we report are sufficiently r e m a r k a b l e to justify further research into using partial evaluation for compiler generation purposes. We also mention other applications. The description here is essentially a snapshot of the mix system and its applications as of early 1987.A partial evaluator m a y be thought of as a " s m a r t interpreter." If an ordinary interpreter is given a p r o g r a m and only part o f this p r o g r a m ' s input data, it will leave * Current address:

show abstract

“…This gives us: This is essentially a hand-compilation of the OR-parallelism of Program I using the principle of converting OR-parallelism into AND-parallelism outlined in Ref. 6. Note that failure in OR-parallelism is replaced by return of the dummy solution none.…”

Section: A Naive Parlog Solution To the 8-puzzlementioning

confidence: 99%

Parallel branch-and-bound search in Parlog

Huntbach

1991

Int J Parallel Prog

View full text Add to dashboard Cite

The concurrent logic languages, of which Parlog is one, have been promoted as a new generation of software languages specifically designed for parallel programming. This paper investigates their apphcation to a search problem commonly used as an illustration of artificial intelligence techniques, the 8-puzzle. It notes that programs written in the concurrent logic languages which do not pay attention to the parallehsm can fall into two possible traps: either there is little real parallelism in them due to data dependencies, or there is too much parallelism and any practical architecture will be overwhelmed. A solution which controls the parallehsm using user-defined priorities is proposed. This solution has the advantage of being architecture-independent.

show abstract

Compiling OR-parallelism into AND-parallelism

Cited by 23 publications

References 1 publication

Flat Parlog: A basis for comparison

Flat Parlog: A basis for comparison

Mix: A self-applicable partial evaluator for experiments in compiler generation

Parallel branch-and-bound search in Parlog

Contact Info

Product

Resources

About