|
Résumé:
|
The three Instruction Set Extension (ISE) enumeration algorithms
described in this paper are Subgraph Enumeration
(SE), Subgraph Removal (SR), and Lucky Subgraph Removal (LSR). SE exhaustively enumerates all convex subgraphs of a
dataflow graph. SR iteratively finds the highest gain subgraph
and then locks the related nodes out of the solution space for the next iteration of the search. Finally, LSR represents our
tunable approach where both SE and SR are used to trade compiler execution time for solution quality in a hardware constrained design space. In this paper we present the mechanics behind these three ISE enumeration algorithms, and
an instruction selection algorithm compatible with all three approaches. |
