308
Network-on-Chip
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Router
Figure 10.9
A reconfigurable topology.
3. Find a route for the traffic flows of each application. The routers are
assumed to follow table-driven routing; hence, specific routing algorithms are not necessary.
The problem can be solved in a two-stage fashion. In the first stage, coreto-network mapping is done, whereas topology and route generation are
performed in the second stage. Each application is described as a communication task graph (CTG), a directed graph G(V,E). Each node v i  ∊ V represents
a task, whereas an edge e i,j  ∊ E represents communication between nodes
v i and v j . The edge is labeled by t i,j , the communication volume (bits per second) between the tasks. Tasks are assumed to be nonmigratory and already
mapped to IP cores.