∑
t
i
, ×W
x y
i
avg
∀ ∈
i applications
t , =
x y
n
309
Reconfigurable Network-on-Chip Design
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Figure 10.10
Another configuration of the topology in Figure 10.9.
10.4.2.2 Core-to-Network Mapping
A weight is assigned to each task graph based on its criticality. Criticality of an
application is defined as the percentage of time the application runs on the NoC.
It is assumed to be assigned by the designer of the NoC and is taken as an input
for the mapping problem. Mapping is performed by first constructing a synthetic/
average task graph, considering task graphs of all applications and their criticality values. This average graph has nodes of all applications. Every pair of nodes
has an edge between them. The weight of edge e x,y
avg
, is calculated as
, t x y
,
t
i
, ×W
x y
i
avg
∀ ∈
i applications
t , =
x y
n
309
Reconfigurable Network-on-Chip Design
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Figure 10.10
Another configuration of the topology in Figure 10.9.
10.4.2.2 Core-to-Network Mapping
A weight is assigned to each task graph based on its criticality. Criticality of an
application is defined as the percentage of time the application runs on the NoC.
It is assumed to be assigned by the designer of the NoC and is taken as an input
for the mapping problem. Mapping is performed by first constructing a synthetic/
average task graph, considering task graphs of all applications and their criticality values. This average graph has nodes of all applications. Every pair of nodes
has an edge between them. The weight of edge e x,y
avg
, is calculated as
, t x y
,
