Please use this identifier to cite or link to this item:
Title: Disjoint pattern enumeration for custom instructions identification
Authors: Yu, P.
Mitra, T. 
Keywords: ASIPs
Custom instruction
Customizable processors
Instruction-set extensions
Subgraph enumeration algorithm
Issue Date: 2007
Citation: Yu, P., Mitra, T. (2007). Disjoint pattern enumeration for custom instructions identification. Proceedings - 2007 International Conference on Field Programmable Logic and Applications, FPL : 273-278. ScholarBank@NUS Repository.
Abstract: 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. © 2007 IEEE.
Source Title: Proceedings - 2007 International Conference on Field Programmable Logic and Applications, FPL
ISBN: 1424410606
DOI: 10.1109/FPL.2007.4380659
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jan 21, 2019


checked on Jan 14, 2019

Page view(s)

checked on Jan 13, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.