Search in concurrent logic languages

Huntbach, Matthew M.

doi:10.1145/315891.315947

Cited by 2 publications

References 31 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

Optimistic evaluation

Ennals

Jones

2003

Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming

View full text Add to dashboard Cite

Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluated, or are always cheap. In this paper we describe Optimistic Evaluation -an evaluation strategy that exploits this observation. Optimistic Evaluation complements compile-time analyses with run-time experiments: it evaluates a thunk speculatively, but has an abortion mechanism to back out if it makes a bad choice. A run-time adaption mechanism records expressions found to be unsuitable for speculative evaluation, and arranges for them to be evaluated more lazily in the future.We have implemented optimistic evaluation in the Glasgow Haskell Compiler. The results are encouraging: many programs speed up significantly (5-25%), some improve dramatically, and none go more than 15% slower.

show abstract

Optimistic evaluation

Ennals

Jones

2003

Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming

View full text Add to dashboard Cite

show abstract

Optimistic evaluation

Ennals

Jones

2003

SIGPLAN Not.

View full text Add to dashboard Cite

Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluated, or are always cheap. In this paper we describe Optimistic Evaluation --- an evaluation strategy that exploits this observation. Optimistic Evaluation complements compile-time analyses with run-time experiments: it evaluates a thunk speculatively, but has an abortion mechanism to back out if it makes a bad choice. A run-time adaption mechanism records expressions found to be unsuitable for speculative evaluation, and arranges for them to be evaluated more lazily in the future.We have implemented optimistic evaluation in the Glasgow Haskell Compiler. The results are encouraging: many programs speed up significantly (5-25%), some improve dramatically, and none go more than 15% slower.

show abstract

Search in concurrent logic languages

Cited by 2 publications

References 31 publications

Optimistic evaluation

Optimistic evaluation

Optimistic evaluation

Contact Info

Product

Resources

About