Topological partitioning based network-on-chip fast mapping algorithm
An on-chip network and algorithm technology, applied to the mapping problem domain in the on-chip network, which can solve large-scale and accurate solutions to complex problems
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0013] 1. IP core communication task graph GTC(C, A), in the directed graph GTC, each vertex c i ∈C represents an IP core. Each directed edge a ij ∈A,a ij Indicates that from the IP core c i to IP core c j communication task; weight v(a ij ) represents the communication task a ij data flow, the unit is bit; weight l(a ij ) represents the communication task a ij The maximum transmission delay allowed, expressed in hops.
[0014] 2. Define the NoC architecture graph NAG(R, P), in the directed complete graph NAG, each vertex r i ∈R represents a resource node; each directed edge p ij ∈P,p ij Indicates slave node r i to node r j routing path; weight d(p ij ) means node r i with node r j The routing distance between is represented by the number of hops; the weight e(p ij ) means along the routing path p ij Energy consumption for transmitting 1 bit of data, e(p ij ) = E bit (d(p ij )).
[0015] 3. Given the IP core communication task graph CTG and the NoC architec...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


