I2CRF: Incremental Interconnect Customization for Embedded Reconfigurable Fabrics Jonghee W. Yoon, Jongeun Lee*, Jaewan Jung, Sanghyun Park, Yongjoo Kim, Yunheung Paek and Doosan Cho** Seoul National University, Korea *UNIST, Korea **Sunchon National University, Korea
19
Embed
I2CRF: Incremental Interconnect Customization for Embedded Reconfigurable Fabrics Jonghee W. Yoon, Jongeun Lee*, Jaewan Jung, Sanghyun Park, Yongjoo Kim,
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
I2CRF: Incremental Interconnect Customization for Embedded Reconfigurable
FabricsJonghee W. Yoon, Jongeun Lee*, Jaewan Jung, Sanghyun Park,
Yongjoo Kim, Yunheung Paek and Doosan Cho**Seoul National University, Korea
*UNIST, Korea**Sunchon National University, Korea
2Udo KebschullUniversity of Heidelberg
Outline• CGRA & Augmentation
• Overall Design Flow• Our Approach (I2CRF)
• Problem definition(Inexact graph matching)• Mapping with A* search
• Experiment• Conclusion
3Udo KebschullUniversity of Heidelberg
Reconfigurable Architecture• Reconfiguration is emerging
• increasing needs for flexible and high speed computing fabrics
• operation level granularity• high performance• S/W development is easy
MorphoSys ADRES
4Udo KebschullUniversity of Heidelberg
Augmentation• General CGRA - Mapping
• CGRA Arch. + Applications Configurations
• Application specific CGRAs - Synthesis • Applications New Arch. + Configurations
• Augmentation• Base CGRA + Applications New Arch.+Configurations
• Customizable Features• The number of PEs• The set of PE operation• Heterogeneity or Homogeneity• Memory subsystem architectures• Interconnection network
Interconnect Exploration for Energy Versus Performance Tradeoffs for Coarse Grained Reconfigurable Architectures, TVLSI 200914% (130nm) 30%(45nm)
Energy consumption
5Udo KebschullUniversity of Heidelberg
Overall design flow - I2CRF
Kernel
Evaluation
Application-Specific Reconfigurable Architecture
Arch ExtensionMapping (A* Search for Minimum-Cost Edit
Path)
+(Accum.)
I2CRF (Incremental Interconnect Customization for Reconfigurable Fabrics )
Base CGRA
Interconnections
Not Satisfied
Vertex Clustering
6Udo KebschullUniversity of Heidelberg
I2CRF• Incremental architecture change by adding
interconnections to the base architecture• Strengths
• Regularity is maintained through the base architecture
• But provides specialization for the target applications
• Fast specialization and no limitation for design space
• The architecture change occurs while kernel is mapped.
7Udo KebschullUniversity of Heidelberg
The difference Compared with general mapping
PE 1
PE 2
PE 3
PE 4
PE 5
PE 6
1
6
3
4 5
2
1 2
6
43
• Existing application mapping for CGRA • Find a graph X C that is isomorphic to K
• Augmentation and Mapping• Find the a graph Y that is isomorphic to K and a subset of C`
which is most similar to C
Kernel graph, K Base CGRA graph, C
5
×
1 2
6
43
5
General Mapping
Augmentation and Mapping
8Udo KebschullUniversity of Heidelberg
Problem Definition - Inexact Graph Matching Problem
• How to find C which is most similar to C0 : Inexact graph matching• Similarity between two graph can be measured by calculating the
cost of graph edit path• Edit path is the set of edit operations that transform G1 into
another G2• Edit operations
– Node(or edge) substitution : NS, ES ( identical or non-identical )– Node(or edge) insertion : NI, EI– Node(or edge) deletion : ND, ED– All the other edit operations are induced by Node substitution.
1 2
3 5
6 7
4
a b c
d e f
g h i
NS1 e2 a3 h4 d5 b6 g7 f
e1
a2
h3
b5
g6
d4f7
Identical ESNon-identical ES & NI
ED EI<G1><G2>
9Udo KebschullUniversity of Heidelberg
Graph Edit Cost Model• Ce - The cost of Edge deletion
• Interconnection insertion cost• Cv - The cost of Node insertion
• Routing PE insertion cost
• Routing PE can replace interconnection insertion in case there are extra PEs
• Do not need augmentation– can reduce the amount of architecture extension
• Cv is much cheaper than Ce
10Udo KebschullUniversity of Heidelberg
A* Search for Min Cost Edit Path• Inexact graph matching problem is NP-complete
How to search the mapping space for the min cost path : A* Search algorithm• Root : Kernel graph• Leaf : Sub-CGRA graph• s : current mapping state• g(s) : The sum of the costs(Ce, Cv) of the graph
edit operations from root to current state s• h(s) : The estimated cost from current state s to
a leaf state• Assessment of the partial mapping s
• g(s) + h(s)
11Udo KebschullUniversity of Heidelberg
Vertex Scattering • Make clusters of vertex and assign each cluster to
row• Strengths of Vertex scattering
• Search space reduction• Considering shared resource constraints