Building-Blocks for Performance Oriented DSLs
EPFL
arXiv:1109.0778v1 [cs.PL] (5 Sep 2011)
@article{2011arXiv1109.0778R,
author={Rompf}, T. and {Sujeeth}, A.~K. and {Lee}, H. and {Brown}, K.~J. and {Chafi}, H. and {Odersky}, M. and {Olukotun}, K.},
title={"{Building-Blocks for Performance Oriented DSLs}"},
journal={ArXiv e-prints},
archivePrefix={"arXiv"},
eprint={1109.0778},
primaryClass={"cs.PL"},
keywords={Computer Science – Programming Languages},
year={2011},
month={sep},
adsurl={http://adsabs.harvard.edu/abs/2011arXiv1109.0778R},
adsnote={Provided by the SAO/NASA Astrophysics Data System}
}
Domain-specific languages raise the level of abstraction in software development. While it is evident that programmers can more easily reason about very high-level programs, the same holds for compilers only if the compiler has an accurate model of the application domain and the underlying target platform. Since mapping high-level, general-purpose languages to modern, heterogeneous hardware is becoming increasingly difficult, DSLs are an attractive way to capitalize on improved hardware performance, precisely by making the compiler reason on a higher level. Implementing efficient DSL compilers is a daunting task however, and support for building performance-oriented DSLs is urgently needed. To this end, we present the Delite Framework, an extensible toolkit that drastically simplifies building embedded DSLs and compiling DSL programs for execution on heterogeneous hardware. We discuss several building blocks in some detail and present experimental results for the OptiML machine-learning DSL implemented on top of Delite.
November 23, 2011 by hgpu