Paper Info
Title
Global Code Selection of Directed Acyclic Graphs
Abstract
. We describe a novel technique for code selection based ondata-flow graphs, which arise naturally in the domain of digital signalprocessing. Code selection is the optimized mapping of abstract operationsto partial machine instructions. The presented method performs animportant task within the retargetable microcode generator CBC, whichwas designed to cope with the requirements arising in the context of customdigital signal processor (DSP) programming. The algorithm exploitsa...
Year
DOI
Venue
1994
10.1007/3-540-57877-3_9
CC
Keywords
Field
DocType
directed acyclic graphs,global code selection,directed acyclic graph
Combinatorics,Microcode,Tree (graph theory),Computer science,Directed acyclic graph,Implicit graph,Dependency graph,Graph (abstract data type),Signal-flow graph,Directed acyclic word graph
Conference
ISBN
Citations 
PageRank 
3-540-57877-3
9
2.38
References 
Authors
18
4
Name
Order
Citations
PageRank
Andreas Fauth1183.65
Günter Hommel2657134.35
Alois Knoll Knoll31700271.32
Carsten Müller4103.09