You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: Royal Holloway, University of London » Outputs » Detail

Output details

11 - Computer Science and Informatics

Royal Holloway, University of London

Return to search Previous output Next output

Output 22 of 90 in the submission

Output title

Better than optimal: fast identification of custom instruction candidates

Type

E - Conference contribution

DOI

10.1109/CSE.2009.167

Name of conference/published proceedings

CSE '09: International Conference on Computational Science and Engineering, 2009

Volume number

Issue number

First page of article

ISSN of proceedings

Year of publication

2009

URL

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5283782

Number of additional authors

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

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract