Disjoint Pattern Enumeration for Custom Instructions Identification

Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analysis of the program's dataflow graphs. The characteristics of certain applications and the modern compiler optimizatio...

Full description

Saved in:
Bibliographic Details
Published in:2007 International Conference on Field Programmable Logic and Applications pp. 273 - 278
Main Authors: Yu, Pan, Mitra, Tulika
Format: Conference Proceeding
Language:English
Published: IEEE 01.08.2007
Subjects:
Application software
Application specific integrated circuits
Application specific processors
ASIPs
Computer aided instruction
Computer architecture
Computer science
custom instruction
customizable processors
Embedded computing
instruction-set extensions
Optimizing compilers
Scalability
Space exploration
subgraph enumeration algorithm
ISBN:1424410592, 9781424410590
ISSN:1946-147X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analysis of the program's dataflow graphs. The characteristics of certain applications and the modern compiler optimization techniques (e.g., loop unrolling, region formation, etc.) have lead to substantially larger dataflow graphs. Hence, it is computationally expensive to automatically select the optimal set of custom instructions. Heuristic techniques are often employed to quickly search the design space. In order to leverage full potential of custom instructions, our previous work proposed an efficient algorithm for exact enumeration of all possible candidate instructions (or patterns) given the dataflow graphs. But the algorithm was restricted to connected computation patterns. In this paper, we describe an efficient algorithm to generate all feasible disjoint patterns starting with the set of feasible connected patterns. Compared to the state-of-the-art technique, our algorithm achieves orders of magnitude speedup while generating the identical set of candidate disjoint patterns.
ISBN:1424410592
9781424410590
ISSN:1946-147X
DOI:10.1109/FPL.2007.4380659