Abstract
We describe a novel technique for code selection based on data-flow graphs, which arise naturally in the domain of digital signal processing. Code selection is the optimized mapping of abstract operations to partial machine instructions. The presented method performs an important task within the retargetable microcode generator CBC, which was designed to cope with the requirements arising in the context of custom digital signal processor (DSP) programming. The algorithm exploits a graph representation in which control-flow is modeled by scopes.
Cite
CITATION STYLE
Fauth, A., Hommel, G., Knoll, A., & Müller, C. (1994). Global code selection for directed acyclic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 786 LNCS, pp. 128–142). Springer Verlag. https://doi.org/10.1007/3-540-57877-3_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
