Noc ajal final
-
Upload
ajal-a-j -
Category
Engineering
-
view
113 -
download
2
Transcript of Noc ajal final
![Page 1: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/1.jpg)
Introduction to Network-on-Chip&
Low Power Routing algorithms
1
Presented by
Professor AJAL A J
![Page 2: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/2.jpg)
Traditional SoC Issues• Variety of dedicated interfaces• Design and verification complexity• Unpredictable performance• Many underutilized wires
2
DMA CPU DSP
Bridge
IO IO IOC
A
B Peripheral Bus
CPU Bus
Control signals
![Page 3: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/3.jpg)
NoC: A paradigm Shift in VLSI
3
s
s
s
s
s s
s
s
Module
Module
s
Module
From: Dedicated signal wires To: Shared network
Point- To-point Link
Network switch
Computing Module
![Page 4: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/4.jpg)
4
Processingelement
NetworkInterface
Router
Inputbuffers
directionallinks
NOC- Working
![Page 5: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/5.jpg)
5
NOC- Working
![Page 6: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/6.jpg)
Typical NoC Design Flow
6
Determine routing and adjust link capacities
![Page 7: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/7.jpg)
Low Power Routing algorithms
![Page 8: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/8.jpg)
Network Topology
Direct In-direct
![Page 9: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/9.jpg)
Direct Topology:
![Page 10: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/10.jpg)
Topology:
10
PE PEPE PE
PE PEPE PE
PE PEPE PE
R R R R
R R R R
PE PEPE PE
R R R R
R R R R
The main problem with the mesh topology is its long diameter that has negative effect on communication latency.
1. Mesh
![Page 11: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/11.jpg)
Topology:
11
PE
PE
PE
PE PE
PE
PE
PE
SW
2.Octagon
![Page 12: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/12.jpg)
Indirect Topology:
![Page 13: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/13.jpg)
Topology:
13
SW
SWSW
SWSW SWSW
PEPE PEPE PEPE PEPE
1.Tree
![Page 14: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/14.jpg)
NoC Routing
Routing algorithm determine path(s) from source to destination. Routing must prevent deadlock, livelock , and starvation.
14
![Page 15: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/15.jpg)
Deadlock, Livelock, and Starvation
Deadlock: A packet does not reach its destination, because it is blocked at some intermediate resource.
Livelock: A packet does not reach its destination, because it enters a cyclic path.
Starvation: A packet does not reach its destination, because some resource does not grant access (wile it grants access to other packets).
15
![Page 16: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/16.jpg)
Low Power Routing algorithms
1. XY Routing2. Wormhole Routing
![Page 17: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/17.jpg)
Routing examplesRouting examples
17
PE DPE PE
PE PEPE PE
PE PEPE PE
R R R R
R R R R
PE PES PE
R R R R
R R R R
Dimension Ordered Routing (XY Routing)
X
Y
![Page 18: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/18.jpg)
S
D
C om m and
Address
Payload
Wormhole Packet:
Flit
Flit
Flit
Wormhole RoutingFor reduced buffering
Flit (routing info)
Flit
Flit
![Page 19: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/19.jpg)
Wormhole Router
R outer
Module
Moduleor
another router
CR
OS
S-B
AR
SchedulerControlRouting CREDIT
B u ffe rsSIG NAL
RT
RD/W R
BLO CK
SIGNAL
RT
RD/W R
BLO CK
CREDIT
SchedulerControlRouting CREDIT
SIG NAL
RT
RD/W R
BLO CK
SIGNAL
RT
RD/W R
BLO CK
CREDIT
O utput portsInput ports
![Page 20: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/20.jpg)
Status and Open Problems• Power
– complex NI and switching/routing logic blocks are power hungry– several times greater than for current bus-based approaches
• Latency– additional delay to packetize/de-packetize data at NIs– flow/congestion control and fault tolerance protocol overheads– delays at the numerous switching stages encountered by packets– even circuit switching has overhead (e.g. SOCBUS)– lags behind what can be achieved with bus-based/dedicated wiring
• Lack of tools and benchmarks• Simulation speed
– GHz clock frequencies, large network complexity, greater number of PEs slow down simulation
20
![Page 21: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/21.jpg)
Trends• Move towards hybrid interconnection fabrics
– NoC-bus based– Custom, heterogeneous topologies
• New interconnect paradigms– Optical– Wireless– Carbon nanotube
21
![Page 22: Noc ajal final](https://reader036.fdocuments.in/reader036/viewer/2022062503/588080501a28ab35718b49d3/html5/thumbnails/22.jpg)
THANK YOU!