21st International Conference on VLSI Design (VLSID 2008) 2008
DOI: 10.1109/vlsi.2008.93
|View full text |Cite
|
Sign up to set email alerts
|

Exhaustive Enumeration of Legal Custom Instructions for Extensible Processors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 17 publications
0
8
0
Order By: Relevance
“…Apart from this, there are some techniques/ algorithms proposed by some researchers that only focused convex maximal subgraph for the same purpose. An algorithm used in [11] accelerates the entire design space optimally by considering all legal patterns of subgraph which satisfies few architectural constraints. Similarly an approach [12] also generates custom instructions without imposing any restrictions on the number of input and output operands on enumerated convex subgraph.…”
Section: Fig 3: Synthesis Of the Customized Hardware And Software Commentioning
confidence: 99%
“…Apart from this, there are some techniques/ algorithms proposed by some researchers that only focused convex maximal subgraph for the same purpose. An algorithm used in [11] accelerates the entire design space optimally by considering all legal patterns of subgraph which satisfies few architectural constraints. Similarly an approach [12] also generates custom instructions without imposing any restrictions on the number of input and output operands on enumerated convex subgraph.…”
Section: Fig 3: Synthesis Of the Customized Hardware And Software Commentioning
confidence: 99%
“…In [17] the authors provided a new algorithm for faster enumeration of legal patterns. They proposed an iterative process which reduced their algorithm runtime by up to two orders of magnitude when compared to the existing work.…”
Section: Pattern Identificationmentioning
confidence: 99%
“…Step 2 enumerates the convex subgraphs of each input ISE and partitions them into isomorphic equivalence classes (IECs) as described by Pothineni et al [13]. For every pair of vertex u and v in convex subgraph S, every path from u to v or from v to u contains only vertices in S. A mergeable class (MC) is an IEC that contains at most one subgraph per ISE.…”
Section: Heuristicmentioning
confidence: 99%
“…Extensible processors allow the user to augment a base processor, typically an in-order RISC or VLIW, with application specific custom instruction set extensions (ISEs) [4,[13][14][15]17]. ISEs may be realized in ASIC technology, along with the processor, or synthesized on a closely-coupled reconfigurable datapath.…”
Section: Introductionmentioning
confidence: 99%