Global code selection for directed acyclic graphs

Andreas Fauth, Günter Hommel, Alois Knoll, Carsten Müller

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

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.

Original languageEnglish
Title of host publicationCompiler Construction - 5th International Conference, CC 1994, Proceedings
EditorsPeter A. Fritzson
PublisherSpringer Verlag
Pages128-142
Number of pages15
ISBN (Print)9783662466629
DOIs
StatePublished - 1994
Externally publishedYes
Event5th International Conference on Compiler Construction, CC 1994 - Edinburgh, United Kingdom
Duration: 7 Apr 19949 Apr 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume786 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Compiler Construction, CC 1994
Country/TerritoryUnited Kingdom
CityEdinburgh
Period7/04/949/04/94

Fingerprint

Dive into the research topics of 'Global code selection for directed acyclic graphs'. Together they form a unique fingerprint.

Cite this