Sciweavers

ASAP
2008
IEEE

Fast custom instruction identification by convex subgraph enumeration

13 years 11 months ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and silicon area combinations. This work introduces a novel method for adapting the instruction set to match an application captured in a high-level language. A simplified model is used to find the optimal instructions via enumeration of maximal convex subgraphs of application data flow graphs (DFGs). Our experiments involving a set of multimedia and cryptography benchmarks show that an order of magnitude performance improvement can be achieved using only a limited amount of hardware resources. In most cases, our algorithm takes less than a second to execute.
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where ASAP
Authors Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. Özturan, Günhan Dündar
Comments (0)