Improved ISE Identification Under Hardware Constraint

Improved ISE Identification Under Hardware Constraint

Show full item record

Title: Improved ISE Identification Under Hardware Constraint
Author: Shapiro, Daniel; Bolic, Miodrag
Abstract: 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.
Date: 2011
URI: http://www.site.uottawa.ca/~dshap092/
http://hdl.handle.net/10393/19799

Files in this item

Files Size Format View
TR-2011-1.pdf 188.5Kb application/pdf View/Open

This item appears in the following Collection(s)

Show full item record


Contact information

Morisset Hall (map)
65 University Private
Ottawa ON Canada
K1N 6N5

Tel. 613-562-5800 (4563)
Fax 613-562-5195

ruor@uottawa.ca