Output details
11 - Computer Science and Informatics
Royal Holloway, University of London
Return to search
Output 0 of 0 in the submission
Output title
Better than optimal: fast identification of custom instruction candidates
Type
E - Conference contribution
Name of conference/published proceedings
CSE '09: International Conference on Computational Science and Engineering, 2009
Volume number
2
Issue number
-
First page of article
17
ISSN of proceedings
-
Year of publication
2009
Number of additional authors
4
Additional information
<08>The authors of this paper separately developed an optimal algorithm for enumerating the set of convex subgraphs under input/output constraints. In this paper that algorithm is applied to the problem of indentifying candidates for custom instructions to be implemented on extensible architectures. Subsequently, Atasu and Reddington (2012) generalised the proof in this paper. The algorithm has been shown to perform better on real world examples than previous industry standard approaches.
Interdisciplinary
-
Cross-referral requested
-
Research group
C - Centre for Software Language Engineering
Citation count
4
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-