Challenges in the compilation of a domain specific language for dynamic programming

Authors:
Robert Giegerich;Peter Steffen
Affiliations:
Bielefeld University, Bielefeld, Germany;Bielefeld University, Bielefeld, Germany
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 9
Cited 5

Sparse dynamic programming I: linear cost functions

Journal of the ACM (JACM)
Sparse dynamic programming II: convex and concave cost functions

Journal of the ACM (JACM)
Building domain-specific embedded languages

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Domain-specific languages: an annotated bibliography

ACM SIGPLAN Notices
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Grammar Flow Analysis

Proceedings on Attribute Grammars, Applications and Systems
A discipline of dynamic programming over sequence data

Science of Computer Programming - Methods of software design: Techniques and applications

A graphical programming system for molecular motif search

Proceedings of the 5th international conference on Generative programming and component engineering
A Common Medium for Programming Operations-Research Models

IEEE Software
GPU parallelization of algebraic dynamic programming

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Bellman's GAP: a declarative language for dynamic programming

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Sneaking around concatMap: efficient combinators for dynamic programming

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specific language embedded in Haskell has been suggested. We point out several shortcomings of this approach, and report on some challenges in the (ongoing) project of migrating this domain specific language from its host language to a directly compiled implementation. Most of these challenges are domain specific optimizations, which not only improve significant constant factors of runtime and space requirements, but also affect asymptotic efficiency. We report on our solutions to some of these problems, and point out others that are still open.