SoC Design Lecture 13: NoC (Network-on-Chip) Department of - - PowerPoint PPT Presentation

soc design lecture 13 noc
SMART_READER_LITE
LIVE PREVIEW

SoC Design Lecture 13: NoC (Network-on-Chip) Department of - - PowerPoint PPT Presentation

SoC Design Lecture 13: NoC (Network-on-Chip) Department of Computer Engineering Sharif University of Technology Outline SoC Interconnect NoC Introduction NoC layers Typical NoC Router NoC Issues Switching


slide-1
SLIDE 1

Department of Computer Engineering Sharif University of Technology

SoC Design Lecture 13: NoC

(Network-on-Chip)

slide-2
SLIDE 2

Outline

 SoC Interconnect  NoC – Introduction  NoC layers  Typical NoC Router  NoC Issues

 Switching  Performance evaluation

 Power consumption

 Different topologies of NoC  Routing Algorithms

 Summary

Sharif University of Technology SoC: Network On Chip Page 2 of 86

slide-3
SLIDE 3

Building a CMP with Shared Memory

 Build a Chip Multi-Processor (CMP) with existing modules  Local & Shared Memory architecture  Schema example:

Memory CPU & Local Memory CPU & Local Memory Interconnect CPU & Local Memory CPU & Local Memory Using existing modules Defining module connections

Sharif University of Technology SoC: Network On Chip Page 3 of 86

slide-4
SLIDE 4

Approaches of Interconnect

 Dedicated wiring

 poor reusability  poor scalability  problems of wiring latency and noise

 Shared bus

 limited bandwidth  limited system complexity

Sharif University of Technology SoC: Network On Chip Page 4 of 86

slide-5
SLIDE 5

Bus Inheritance

From Board level into Chip level…

P P

Sharif University of Technology SoC: Network On Chip Page 5 of 86

slide-6
SLIDE 6

Typical Solution : Bus

Shared Bus

B B

Segmented Bus

Sharif University of Technology SoC: Network On Chip Page 6 of 86

slide-7
SLIDE 7

Original bus features:

  • One transaction at a time
  • Central Arbiter
  • Limited bandwidth
  • Synchronous
  • Low cost

Typical Solution : Bus

Multi-Level Segmented Bus

B B

Segmented Bus

New features:

  • Versatile bus architectures
  • Pipelining capability
  • Burst transfer
  • Split transactions
  • Transaction preemption and resume
  • Transaction reordering…

B B

Sharif University of Technology SoC: Network On Chip Page 7 of 86

slide-8
SLIDE 8

Approaches of Interconnect (Cont’d)

 Parallel topologies have been proposed to increase the amount

  • f delivered bandwidth

 Ex. partial or full crossbars

 Scalability limitations of crossbar-based interconnection fabrics are well

known

 New communication protocols have been developed: more

effective exploitation of the available bandwidth

 Ex. : AMBA 3.0 AXI and the open-core protocol (OCP)  Provide support for point-to-point communication only and do not provide any

specification on the interconnect fabric

Sharif University of Technology SoC: Network On Chip Page 8 of 86

slide-9
SLIDE 9

Approaches of Interconnect (Cont’d)

 Networks-on-chip (NoCs)

 Most important alternative for the design of modular and scalable

communication architectures

 Providing inherent support to the integration of heterogeneous cores

through standard socket interfaces

 Relieve system-level integration issues  Suitable to deal with the challenges of nanoscale technology

 Area and power overheads is significant in spite of the

performance benefits

Sharif University of Technology SoC: Network On Chip Page 9 of 86

slide-10
SLIDE 10

Outline

 SoC Interconnect  NoC – Introduction  NoC layers  Typical NoC Router  NoC Issues

 Switching  Performance evaluation

 Power consumption

 Different topologies of NoC  Routing Algorithms

 Summary

Sharif University of Technology SoC: Network On Chip Page 10 of 86

slide-11
SLIDE 11

New Solution: On-chip Communication

 Bus based interconnect

 Low cost  Easier to Implement  Flexible  Networks on Chip

 Layered Approach  Buses replaced with Networked

architectures

 Better electrical properties  Higher bandwidth  Energy efficiency  Scalable

Irregular architectures Regular Architectures Bus-based architectures

Sharif University of Technology SoC: Network On Chip 11of 86

slide-12
SLIDE 12

12 of 86

What is NoC?

 According to Wikipedia:

 “Network-on-a-chip (NoC) is a new paradigm for System-

  • n-Chip (SoC) design. NoC based-systems accommodate

multiple asynchronous clocking that many of today's complex SoC designs use. The NoC solution brings a networking method to on-chip communications and claims roughly a threefold performance increase over conventional bus systems.”

 Imprecise…

Sharif University of Technology SoC: Network On Chip

slide-13
SLIDE 13

13 of 86

Processor Master Global Memory Slave Global I/O Slave Global I/O Slave Processor Master Processor Master Processor Master Processor Master Processor Master Processor Master Processor Master Processor Master Routing Node Routing Node Routing Node Routing Node Routing Node Routing Node Routing Node Routing Node Routing Node

NoC Exemplified

Sharif University of Technology SoC: Network On Chip

slide-14
SLIDE 14

14 of 86

Basic Ingredients of an NoC

 N Computational Resources

 Processing Elements (PE)

 1 Connection Topology  1 Routing technique  M  N Switches  N Network Interfaces

Sharif University of Technology SoC: Network On Chip

slide-15
SLIDE 15

15 of 86

For the Connoisseurs…

 1 Addressing system  1 Switch-level Arbitration policy  1 Communication Protocol  1 Programming model

 Message passing  Shared Memory

Sharif University of Technology SoC: Network On Chip

slide-16
SLIDE 16

NoC’s Requirements

Requirements:

 Different QoS must be supported

 Bandwidth  Latency

 Distributed deadlock free routing  Distributed congestion/flow control  Low VLSI Cost

Sharif University of Technology SoC: Network On Chip Page 16 of 86

slide-17
SLIDE 17

17 of 86

NoC: Good news

 Only point-to-point one-way wires are used, for all network sizes  Aggregated bandwidth scales with the network size  Routing decisions are distributed and the same router is re-instantiated, for all network sizes  NoCs increase the wires utilization (as opposed to ad- hoc p2p wires)

Sharif University of Technology SoC: Network On Chip

slide-18
SLIDE 18

18 of 86

NoC: Bad news

 Internal network contention causes (often

unpredictable) latency

 The network has a significant silicon area  Bus-oriented IPs need smart wrappers  Software needs clean synchronization in

multiprocessor systems

 System designers need reeducation for new concepts

Sharif University of Technology SoC: Network On Chip

slide-19
SLIDE 19

19 of 86

Facts about NoCs

 It is a way to decouple computation from

communication

 The design is layered (physical, network,

application…)

 Communication between processing elements in NoC

takes place by encapsulating data in packets

 The elementary packet piece to which switch and

routing operations apply is the flit

Sharif University of Technology SoC: Network On Chip

slide-20
SLIDE 20

Network on Chip vs. Bus

 Networks are preferred over buses:

 Higher bandwidth  Concurrency, effective spatial reuse of resources  Higher levels of abstraction  Modularity - Design Productivity Improvement  Scalability

Sharif University of Technology SoC: Network On Chip Page 20 of 86

slide-21
SLIDE 21

NoC vs. “Off-Chip” Networks

What is Different?

 Routers on Planar Grid Topology  Short p2p Links between routers  Unique VLSI Cost Sensitivity:

 Area-Routers and Links  Power

Sharif University of Technology SoC: Network On Chip 21of 86

slide-22
SLIDE 22

NoC vs. “Off-Chip” Networks (Cont’d)

 No legacy protocols to be compliant with …  No software  simple and hardware efficient protocols  Different operating env. (no dynamic changes and failures)  Custom Network Design – You design what you need!

Replace

Example1: Replace modules

Sharif University of Technology SoC: Network On Chip 22of 86

slide-23
SLIDE 23

23 of 86

Who first had the idea?

 No clear parenthood. The most referred papers

according to Google (#cit.)

 Guerrier’00 (204), A Generic Architecture for On-Chip

Packet-Switched Interconnections

 Dally’01 (392), Route Packets, Not Wires: On-Chip

Interconnection Networks

 Benini’02 (417), Networks on Chips: A New SoC Paradigm  Kumar’02 (184), A Network on Chip Architecture and

Design Methodology

Sharif University of Technology SoC: Network On Chip

slide-24
SLIDE 24

24 of 86

SPIN (Guerrier et al., DATE ’00/’03)

Wormhole switching, adaptive routing and credit-based flow control

It is based on a fat-tree topology

A flit is only one word (36 bits, 4 bits are for packet framing)

The input buffers have a depth of 4 words

Sharif University of Technology SoC: Network On Chip

slide-25
SLIDE 25

25 of 86

Dally et al., DAC’01

2D folded torus topology

Wormhole routing and Virtual Channels (VC)

Sharif University of Technology SoC: Network On Chip

slide-26
SLIDE 26

26 of 86

Kumar et al., ISLVLSI’02

 Chip-Level Integration of Communicating Heterogeneous Elements, CLICHÉ’  2D Mesh Topology  Message Passing

Sharif University of Technology SoC: Network On Chip

slide-27
SLIDE 27

27 of 86

Pande et al., TCOMP’05

Butterfly Fat Tree

Wormhole, Virtual channels

Header flits: 3 ck cycles latency (input arbitration, routing, output arbitration)

“Body” flits: 3 ck cycles (input arbitration, switch traversal, output arbitration)

Sharif University of Technology SoC: Network On Chip

slide-28
SLIDE 28

28 of 86

Goossens et al., IEE CDT’03

 Both VCT and WH, GT and BE  GT uses TDM to avoid contention

and create virtual circuits

 In each time slot a block of 3 flits

is transferred from In “j” to Out “k” in a S&F fashion

 BE uses Matrix Scheduling  GT connections set up by BE

special system packets

 Prototype with WH

 5 ports  0.13 um, 0.26 mm2 , 500/166

MHz

 Flit size = 3 words, each 32 bits  80 Gb/s aggregate bandwidth Sharif University of Technology SoC: Network On Chip

slide-29
SLIDE 29

29 of 86

Common Properties

 Data integrity: means that data is delivered

uncorrupted

 Lossless data delivery: means no data is dropped in

the interconnect

 In-order data delivery: specifies that the order in

which data is delivered is the same order in which it has been sent

 Throughput and Latency: services that offer time

related bounds

Sharif University of Technology SoC: Network On Chip

slide-30
SLIDE 30

CPU

Network Interface Network Interface Switch Switch

Network on Chip (NOC)

buffers buffers Network Interface Switch

Links to/from

  • ther switches or

network interfaces

The Interconnection Network

Mem.

Sharif University of Technology SoC: Network On Chip 30of 86

slide-31
SLIDE 31

Communication Centric Design

Application Architecture Library Architecture / Application Model Good? Evaluate Analysis / Profile Configure Refine NoC Optimization No Synthesis Optimized NoC

Sharif University of Technology SoC: Network On Chip Page 31 of 86

slide-32
SLIDE 32

Outline

 SoC Interconnect  NoC – Introduction  NoC layers

 Physical layer  Data link layer  Network layer  Transport Layer  Application Layer 

Typical NoC Router

NoC Issues

Switching

Performance evaluation

Power consumption 

Different topologies of NoC

Routing Algorithms

Region

Summary

Sharif University of Technology SoC: Network On Chip Page 32 of 86

slide-33
SLIDE 33

Network on Chip - Layers

Software Transport Network Wiring Separation

  • f concerns

Queuin g Theory Traffic Modeling Architect ures Networking

Sharif University of Technology SoC: Network On Chip 33of 86

slide-34
SLIDE 34

Several Layers of Communication

 Communication Layers and unit of communication:

 Physical layer: Word  Data link layer: Flit  Network layer: Packet  Transport layer: Message  Application layer

Sharif University of Technology SoC: Network On Chip Page 34 of 86

slide-35
SLIDE 35

Flow of Data from Source to Sink through the NoC Components

Sharif University of Technology SoC: Network On Chip Page 35 of 86

slide-36
SLIDE 36

NoC Layering – Physical interpretation

Sharif University of Technology SoC: Network On Chip Page 36 of 86

slide-37
SLIDE 37

Physical Layer

 Parameters:

 Physical distance  Number of lines  Activity control  Buffers and pipelining

Sharif University of Technology SoC: Network On Chip 37of 86

slide-38
SLIDE 38

Data Link Layer

 Parameters:

 Line frequency versus switch

frequency (word versus flit)

 Buffering  Error correction  Power optimization; e.g.

avoid activity and power

  • ptimized encoding

Sharif University of Technology SoC: Network On Chip 38of 86

slide-39
SLIDE 39

Network Layer

 Parameters:

 flit size versus packet size  Network address scheme, e.g. 4 + 4

bit for 16*16 resources

 Routing algorithm  Priority classes: e.g. 2 classes:

 high priority, fixed delay flits  low priority, best effort delay flits

 Error correction

Sharif University of Technology SoC: Network On Chip 39of 86

slide-40
SLIDE 40

Transport Layer

 Parameters:

 Message size  Virtual channels with traffic profiles  Signaling  Priority classes of channels, e.g.

 constant bit rate traffic  varying bit rate traffic

 Network resource management  Error correction

Sharif University of Technology SoC: Network On Chip 40of 86

slide-41
SLIDE 41

Application Layer

 Interprocess communication at the

task level:

 send / receive for individual

messages

 open; write/read; close for channel

based communication

 Mapping issues:

 Assigning tasks to resources  Translating task addresses to

resource/task addresses

 Establishing and closing channels  Static allocation versus dynamic

allocation

Sharif University of Technology SoC: Network On Chip 41of 86

slide-42
SLIDE 42

Outline

 SoC Interconnect  NoC – Introduction  NoC layers  Typical NoC Router  NoC Issues

 Switching  Performance evaluation

 Power consumption

 Different topologies of NoC  Routing Algorithms  Region

 Summary

Sharif University of Technology SoC: Network On Chip Page 42 of 86

slide-43
SLIDE 43

Regular Network on Chip

PE PE PE PE PE PE PE PE PE PE Router

Sharif University of Technology SoC: Network On Chip Page 43 of 86

slide-44
SLIDE 44

Typical NoC Router

LC LC Crossbar Switch LC LC LC FC FC FC FC FC Routing Arbitration LC FC

Sharif University of Technology SoC: Network On Chip Page 44 of 86

slide-45
SLIDE 45

Outline

 SoC Interconnect  NoC – Introduction  NoC layers  Typical NoC Router  NoC Issues

 Switching  Performance evaluation

 Power consumption

 Different topologies of NoC  Routing Algorithms

 Summary

Sharif University of Technology SoC: Network On Chip Page 45 of 86

slide-46
SLIDE 46

NoC Issues

 Application Specific Optimization

 Switching  Buffers  Routing  Topology  Mapping to topology  Implementation and Reuse

Irregular architectures Regular Architectures

LC LC

Crossbar Switch

LC LC LC FC FC FC FC FC Routing Arbitration LC FC

Sharif University of Technology SoC: Network On Chip Page 46 of 86

slide-47
SLIDE 47

Mapping Problems

 Link bandwidth requirement  Communication latency

 routing algorithm

 Communication flow

 power consumption

Sharif University of Technology SoC: Network On Chip Page 47 of 86

slide-48
SLIDE 48

48 of 86

Switching

 Again, techniques inherited from Computer and Communication Networks  Flow control is a synchronization protocol for transmitting and receiving a

unit of information

 Switching techniques differ in the relationship between the sizes of the

physical and message flow control units

 New constraints in silicon: area and power

 Use as few buffers as possible

Store & Forward and Virtual-Cut-Through

 Need buffers size for an entire packet, unsuited!

Limited buffer size in

 Wormhole

Virtual channels

 Increase buffer size… Sharif University of Technology SoC: Network On Chip

slide-49
SLIDE 49

Switching (Cont’d)

 Circuit Switching  Packet Switching (Store-and-Forward)  Virtual Cut-Through Switching  Wormhole switching  Hybrid architecture

Sharif University of Technology SoC: Network On Chip Page 49 of 86

slide-50
SLIDE 50

Circuit Switching

 A physical path from the source to the destination is reserved

prior to the transmission of the data

 routing information set up during initialization

 Guaranteed transmission latency and throughput  Switch design has lower complexity  Advantageous when messages are infrequent and long

 Suitable for application-specific SoC

 Disadvantage : physical path is reserved for the duration of the

message and may block other messages

Sharif University of Technology SoC: Network On Chip Page 50 of 86

slide-51
SLIDE 51

Circuit Switching (Cont’d)

Sharif University of Technology SoC: Network On Chip Sharif University of Technology SoC: Network On Chip Page 51 of 86

slide-52
SLIDE 52

Packet Switching

 Each packet is individually routed from source to destination  A packet is completely buffered at each intermediate node before it is

forwarded to the next node

 Advantageous when messages are short and frequent  Disadvantage :

 Splitting a message into packets produces some overhead  In addition to the time required at source and destination nodes, every packet

must be routed at each intermediate node

 Structure

 Switch design has higher complexity

 Modularity

 interface  reusability

 Scalability

 bandwidth Sharif University of Technology SoC: Network On Chip Page 52 of 86

slide-53
SLIDE 53

Packet Switching (Cont’d)

Sharif University of Technology SoC: Network On Chip Sharif University of Technology SoC: Network On Chip Page 53 of 86

slide-54
SLIDE 54

Virtual Cut-Through Switching

 Packet switching : a packet must be received in its entirety before any

routing decision can be made and the packet forwarded to the destination

 Virtual Cut-Through: Packet header can be examined as soon as it is

received

 Router starts forwarding the header and following data bytes as soon as routing

decisions have been made and the output buffer is free

Sharif University of Technology SoC: Network On Chip Sharif University of Technology SoC: Network On Chip Page 54 of 86

slide-55
SLIDE 55

NoC Wormhole Routing

 Message packets are also pipelined through the network  The flit is the unit of message flow control, and input and output buffers at

a router are typically large enough to store a few flits

 Wormhole Routing

 For reduced buffering

Wormhole Packet:

Flit Flit Flit Flit (routing info) Flit Flit

Sharif University of Technology SoC: Network On Chip 55of 86

slide-56
SLIDE 56

NoC Wormhole Router

Sharif University of Technology SoC: Network On Chip 56 of 86

slide-57
SLIDE 57

Virtual Channel

 Sharing of a physical channel by several logically separate

channels with individual and independent buffer queues

 Advantages:

 Avoiding deadlocks  Optimizing wire utilization  Improving performance  Providing differentiated services

 Disadvantages:

 Area overhead  Power overhead

Sharif University of Technology SoC: Network On Chip Page 57 of 86

slide-58
SLIDE 58

Virtual Channel (Cont’d)

SW0 SW1 SW2 SW3 Node A Node B Packet  Packet 

Sharif University of Technology SoC: Network On Chip 58 of 86

slide-59
SLIDE 59

Outline

 NoC Issues

 Switching  Performance evaluation

 Power consumption

 Different topologies of NoC  Routing Algorithms

Sharif University of Technology SoC: Network On Chip Page 59 of 86

slide-60
SLIDE 60

NoC Analysis

 Universally applicable parameters of NoC :

 Latency  Bandwidth  Jitter  Power consumption  Area usage

Sharif University of Technology SoC: Network On Chip Page 60 of 86

slide-61
SLIDE 61

NoC Analysis (Cont’d)

 Analytical performance model for the on-chip communications  Stochastic modeling based on queuing theory Router Network Interface Processing node Priority Queue

Sharif University of Technology SoC: Network On Chip 61 of 86

slide-62
SLIDE 62

Importance of Performance Evaluation

 Customization of NoC resources  Reduction of cost in the communication network  Maintaining the required Quality of Service  Evaluation of different configuration to increase

performance

Sharif University of Technology SoC: Network On Chip Page 62 of 86

slide-63
SLIDE 63

Latency Metrics

Sender Receiver Sender Overhead Transmission time (size ÷ bandwidth) Transmission time (size ÷ bandwidth) Time of Flight Receiver Overhead Transport Latency Total Latency = Sender Overhead + Time of Flight + Message Size ÷ BW + Receiver Overhead Total Latency (processor busy) (processor busy)

Sharif University of Technology SoC: Network On Chip 63 of 86

slide-64
SLIDE 64

Sources of Power Consumption

 Shared memory power consumption  Node power consumption  Interconnect network power consumption

 The internal node switch  The internal buffers  The interconnect wires

PNoC = Prouters + Plinks

Sharif University of Technology SoC: Network On Chip Page 64 of 86

slide-65
SLIDE 65

Simple Energy Model

 Hu assume:

 Ebit = ESbit + EBbit + EWbit + ELbit

 Simplifying assumptions:

 Buffer implemented using latches and

flip-flops

 Negligible internal wire energy

 Router to Router Energy (minimal

routing)

 Ebit= nhops x ESbit + (nhops – 1) x ELbit  nhops proportional to energy

consumption

PE1 PE2 PE3

Sharif University of Technology SoC: Network On Chip 65 of 86

slide-66
SLIDE 66

Outline

 NoC Issues

 Switching  Performance evaluation  Different topologies of NoC  Routing Algorithms

Sharif University of Technology SoC: Network On Chip Page 66 of 86

slide-67
SLIDE 67

67 of 86

Different Topologies for NoC

Heritage of networks with new constraints

Need to accommodate interconnects in a 2D layout

Cannot route long wires (clock frequency bound)

a) SPIN, b) CLICHE’ c) Torus d) Folded torus e) Octagon f) BFT.

Sharif University of Technology SoC: Network On Chip

slide-68
SLIDE 68

CPU & Local Memory Global Memory Network Interface Network Switch

MEM MEM

Fat tree

MEM

Bus

Topologies - Examples

Sharif University of Technology SoC: Network On Chip Page 68 of 86

slide-69
SLIDE 69

Tree

MEM MEM

Star

CPU & Local Memory Global Memory Network Interface Network Switch

MEM

 7 CPUs with local memory  1 Global memory  1 8-port switch  8 Network interfaces

Topologies – Examples (Cont’d)

Sharif University of Technology SoC: Network On Chip Page 69 of 86

slide-70
SLIDE 70

Topology - Mesh

 Bidirectional links (double

the connections)

 Asymetric at edges

Sharif University of Technology SoC: Network On Chip Page 70 of 86

slide-71
SLIDE 71

Topology – Mesh (Cont’d)

 Resource-to-switch ratio: 1  A switch is connected to 4 switches and 1 resource  A resource is connected to 1 switch  Max number of hops grows with 2n

Sharif University of Technology SoC: Network On Chip Page 71 of 86

slide-72
SLIDE 72

Topologies - Tree

 One route  Bidirectional links  Top-level nodes

  • verloaded

Sharif University of Technology SoC: Network On Chip Page 72 of 86

slide-73
SLIDE 73

Outline

 NoC Issues

 Switching  Performance evaluation  Different topologies of NoC  Routing Algorithms

Sharif University of Technology SoC: Network On Chip Page 73 of 86

slide-74
SLIDE 74

Routing

 Objective : Find a path from a source node to a

destination node on a given topology

 One of the key components that determine the

performance of the network

 Performance measures of a routing algorithm:

 Reduce the number of hops and overall latency  Balance the load of network channels

Sharif University of Technology SoC: Network On Chip Page 74 of 86

slide-75
SLIDE 75

Routing Algorithm

 Connection-oriented vs. connectionless

 Connection-oriented : involve a dedicated (logical) connection path

established prior to data transport.

 Connectionless : the communication occurs in a dynamic manner with

no prior arrangement between the sender and the receiver

 Minimal vs. nonminimal routing

 Minimal : only consider minimal routes (shortest path)  Non-Minimal : allow even nonminimal routes

Sharif University of Technology SoC: Network On Chip Page 75 of 86

slide-76
SLIDE 76

Routing Algorithm (Cont’d)

 Central vs. distributed control

 Centralized control : routing decisions are made globally  Distributed control : routing decisions are made locally

 Delay vs. loss

 Delay model : datagrams are never dropped  Loss model : datagrams can be dropped

 Deterministic vs. adaptive routing

Sharif University of Technology SoC: Network On Chip Page 76 of 86

slide-77
SLIDE 77

Deterministic Routing

 Deterministic algorithms always choose the same path

between two nodes

 Advantages

 Simple and inexpensive to implement  Usual deterministic routing is minimal, which leads to short

path length

 Packets arrive in order

 Disadvantage

 Lack of path diversity can create large load imbalances

Sharif University of Technology SoC: Network On Chip Page 77 of 86

slide-78
SLIDE 78

Dimension-Order Routing in Tori and Meshes

 Also called e-cube routing  Digits of destination address are used to route the packet

through the network

 Since a torus can be traversed in clockwise or counterclockwise

direction, the preferred direction in each dimension have to be calculated first

 The packet is the routed along these directions { +x, -x, +y, -y }

until it reaches its destination

 Advantages

 Simple Router (no tables, simple logic)  Power efficient communication  No deadlock scenario

Sharif University of Technology SoC: Network On Chip Page 78 of 86

slide-79
SLIDE 79

Oblivious Routing

 Oblivious algorithms always choose a route without

knowing about the state of the networks state

 All random algorithms are oblivious algorithms  All deterministic algorithms are oblivious algorithms

Sharif University of Technology SoC: Network On Chip Page 79 of 86

slide-80
SLIDE 80

Adaptive Routing

 Adaptive algorithms use information about the state of

the network to make routing decisions

 Length of queues  Historical channel load

 Typically a node has only local information such as

information on the load of the connected links

 Two types:

 Fully adaptive  Partially adaptive

Sharif University of Technology SoC: Network On Chip Page 80 of 86

slide-81
SLIDE 81

Fully Adaptive Routing

 Fully-Adaptive Routing does not restrict packets to

take the shortest path

 This can help to avoid congested areas  Fully-Adaptive Routing may result in deadlock  Mechanisms must be added to prevent deadlock

Sharif University of Technology SoC: Network On Chip Page 81 of 86

slide-82
SLIDE 82

82 of 86

Simulation Issues

 Stochastic traffic generators

 Ease of implementation/simulation  Fast simulation  Self-similar traffic used by some

 Trace-Based Simulation

 Need for extensive pre-simulation  Long simulations (days-weeks)  Accurate results

Sharif University of Technology SoC: Network On Chip

slide-83
SLIDE 83

Traffic Pattern

 Categories of traffic within a system:

1.

Latency Critical : with stringent latency demands such as for critical interrupts, memory access, etc.

  • These often have low payload

2.

Data Streams : Have high payload and demand QoS in terms

  • f bandwidth
  • Most often it is large, mostly fixed bandwidth, which may be jitter

critical

  • Ex. : MPEG data, DMA access, etc

3.

Miscellaneous : with no specific requirements of commitment from the network

Sharif University of Technology SoC: Network On Chip Page 83 of 86

slide-84
SLIDE 84

84 of 86

Applications

 Main NoC feature: high communication bandwidth  Desirable feature for MP-SoC: low communication latency  The twos are often contrasting requirements:

 “Bandwidth problems can be cured with money. Latency problems are

harder because the speed of light is fixed—you can’t bribe God.” — Anonymous

 Desperately seeking benchmarks and killer applications

 Multimedia?

Sharif University of Technology SoC: Network On Chip

slide-85
SLIDE 85

85 of 86 Sharif University of Technology SoC: Network On Chip

What is New?

 Amazing application of network ideas to the chip context  But ideas need to be re-contextualized  Old constraints

 Latency, bandwidth

 New constraints are very tight

 Area, Power, Clocks

 Differences of fine-grain NoC with large-grain Networks

 Today links are 100% reliable. Might become false for ultra-scaled technologies

and globally asynchronous NoC

 For many applications, lowest latency is more important than highest bandwidth Sharif University of Technology SoC: Network On Chip

slide-86
SLIDE 86

Summary

 In SoC : Interconnect dominates delay and power  Design challenges for future SoC design

 Wiring delay  Synchronization  Noise  Power dissipation

 On chip communication with a network is very simple and

reliable

 NoC architecture has a great effect on delay and power of

SoC interconnection

 Routing algorithm, switching mechanism, topology and traffic

pattern affect both power and delay of an NoC

Sharif University of Technology SoC: Network On Chip Page 86 of 86