Run-time code generation in c++ as a foundation for domain-specific optimisation (2003)
| Venue: | In Proceedings of the 2003 Dagstuhl Workshop on Domain-Specific Program Generation |
| Citations: | 16 - 4 self |
BibTeX
@INPROCEEDINGS{Beckmann03run-timecode,
author = {Olav Beckmann and Alastair Houghton and Michael Mellor and Paul H J Kelly},
title = {Run-time code generation in c++ as a foundation for domain-specific optimisation},
booktitle = {In Proceedings of the 2003 Dagstuhl Workshop on Domain-Specific Program Generation},
year = {2003},
pages = {291--306}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
www.doc.ic.ac.uk/{~ob3,~phjk} Abstract. The TaskGraph Library is a C++ library for dynamic code generation, which combines specialisation with dependence analysis and loop restructuring. A TaskGraph represents a fragment of code which is constructed and manipulated at runtime, then compiled, dynamically linked and executed. TaskGraphs are initialised using macros and overloading, which forms a simplified, C-like sub-language with first-class arrays and no pointers. Once a TaskGraph has been constructed, we can analyse its dependence structure and perform optimisations. In this Chapter, we present the design of the TaskGraph library, and two sample applications to demonstrate its use for runtime code specialisation and restructuring optimisation. 1
