Module Module Module Module Module Module Module Module Module Module Module Module Module Module R R R R R R R R R R R R R R Module R R R Efficient Link Capacity and QoS Design for Wormhole Network-on-Chip Zvika Guz, Isask’har Walter, Evgeny Bolotin, Israel Cidon, Ran Ginosar and Avinoam Kolodny Technion, Israel Institute of Technology
33
Embed
Module R R RRR R RRRRR RR R R R R Efficient Link Capacity and QoS Design for Wormhole Network-on-Chip Zvika Guz, Isask ’ har Walter, Evgeny Bolotin, Israel.
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
Module
Module
Module
Module
Module
Module
Module
Module
Module Module Module
Module
Module
Module
R
R
R R R
R
RR R R R
R R
R
Module
R
R
R
Efficient Link Capacity and QoS Design for Wormhole
Network-on-Chip
Zvika Guz, Isask’har Walter, Evgeny Bolotin, Israel Cidon, Ran Ginosar and
Avinoam Kolodny
Technion, Israel Institute of Technology
DATE’06 NoC Capacity Allocation 2
Problem Essence
How much capacity [bits/sec] should be assigned to each link? - All flows must meet delay requirements - Minimize total resources
R
R
R R R
R
RR R R R
R R
R
R
R
R
DATE’06 NoC Capacity Allocation 3
Outline
Wormhole based NoC The problem of link capacity allocation Solution:
- Network topology- Link capacities- Communication demands
DATE’06 NoC Capacity Allocation 13
Because they assume:- Symmetrical communication demands - No virtual channels- Identical link capacity!
Generally, they calculate the delay of an“average flow”- A per-flow analysis is needed
Why Previous Models Do Not Apply?
DATE’06 NoC Capacity Allocation 14
IP1
Inte
rfac
e
IP2Interface
Wormhole Delay Analysis
The delivery resembles a pipeline pass
Packet transmission can be divided into two separated phases:- Path acquisition- Packet delivery
We focus on packet delivery phase
DATE’06 NoC Capacity Allocation 15
IP1
Inte
rfac
e
IP2Interface
Packet delivery time is dominated by the slowest link- Transmission rate- Link sharing
Packet Delivery Time
Low-capacity link
DATE’06 NoC Capacity Allocation 16
IP1
Inte
rfac
e
Interface Interface
IP2
Packet Delivery Time
Packet delivery time is dominated by the slowest link- Transmission rate- Link sharing
IP3
DATE’06 NoC Capacity Allocation 17
Analysis Basics
Determines the flow’s effective bandwidth Per link
Account for interleaving
tt
DATE’06 NoC Capacity Allocation 18
- mean time to deliver a flit of flow i over link j [sec] - capacity of link j [bits per sec] - flit length [bits/flit] - total flit injection rate of all flows sharing link j
except for flow i [flits/sec]
Single Hop Flow, no Sharing
1
1ij
jl
tC
t
ijt
jC
ij
l
DATE’06 NoC Capacity Allocation 19
- mean time to deliver a flit of flow i over link j [sec] - capacity of link j [bits per sec] - flit length [bits/flit] - total flit injection rate of all flows sharing link j
except for flow i [flits/sec]
1
1ij i
j jl
tC
ijt
jC
ij
l
Bandwidth used by
other flows on link j
Single Hop Flow, with Sharing
tt
DATE’06 NoC Capacity Allocation 20
The Convoy Effect
Consider inter-link dependencies - Wormhole backpressure - Traffic jams down the road
1
1ij i
j jl
tC
| ( , )ij
i ii i k kj j i
k k k
l tt t
C dist j k
Link Load
Account for all subsequent hops Basic delay
weighted by distance
DATE’06 NoC Capacity Allocation 21
Weakest link dominates packet delivery time
Total Packet Transmission Time
- mean packet latency for flow i [sec]iT
max( | )i i i ijT m t j
Packet size[flits/packet]
Account for weakest link
=
- mean packet latency for flow i [sec]
DATE’06 NoC Capacity Allocation 22
Outline
Wormhole based NoC The problem of link capacity allocation Solution:
E. Bolotin, I. Cidon, R. Ginosar, A. Kolodny, “QoS Architecture and Design Process for Cost-Effective Network on Chip”, Journal of Systems Architecture, 2004
DATE’06 NoC Capacity Allocation 32
Analysis and Simulation vs. Load
No
rmal
ized
Del
ay
Utilization
Analytical model was validated using simulations- Different link capacities- Different communication