SURVEY OF NETWORK ON

CHIP ROUTING
ALGORITHMS

PRESENTED BY

NETWORK ON CHIP (NOC)

Network-on-chip is a communication network targeted for

on chip.

NOC is a communication framework for multicores

connected together in regular or irregular topologies.
NoC is a new paradigm for System on Chip (SoC) design.

Increasing integration in bus structure, which is

commonly used in SoC, poses physical problems.

In NoC architecture traditional bus structure is replaced

with a network which is a lot similar to the Internet.

NETWORK-ON-CHIP (NOC)
ARCHITECTURES

Emerging for the

Highly

scalable
Reliable
modular on-chip communication infrastructure paradigm.

The NoC architecture uses

layered protocols
packet-switched networks
( which consist of on-chip routers, links, and network interfaces on a
predefined
topology.)

Definition-Network-on-chip is a communication
network targeted for on chip.

BASIC PROPERTIES OF THE NOC

PARADIGM
separates

communication from computation

avoids

global, centralized controller for

communication.

allows

arbitrary number of terminals.

Topology

allows the addition of links as the

system size grows (offers scalability).

Customization

topology).

(link width, buffer sizes, even

Allow

multiple voltage and frequency

domains.

Delivers

data in-order either naturally or via

layered protocols.

To

varying guarantees for transfers

To

support for system testings

Delivers

data in-order either naturally or via

layered protocols.

To

varying guarantees for transfers

MAJOR GOAL NOC PARADIGM

Achieve greater design productivity
Performance by handling the increasing parallelism
Manufacturing complexity
Wiring problems
and Reliability

NETWORK ON CHIP (NOC)

Data communications between segments of chip are

packetized and transferred through the network.

The network consists of wires and routers.

Processors, memories and other IP-blocks
(Intellectual Property) are connected to routers.

A routing algorithm plays a significant role on

networks operation.

Routers make the routing decisions based on the

routing algorithm

NETWORK-ON-CHIP
Network-On-Chip (NoC) consists of
Routers
interconnects(links)
processing elements (PEs)
and network interfaces(NI).

NETWORK-ON-CHIP

NETWORK-ON-CHIP WHY?????

NoC have replaced the traditional bus

Well structured

Arranged in a particular topology.

scalable and modular.

Higher bandwidth as compared to bus

Support multiple parallel communications.

More organized

Efficient utilization of the network resources

Better cost

Performance parameters

NOC ROUTING
Quite similar to routing on any network.
A router is a device that forwards data packets
between computer networks, creating an overlay
internetwork.
A routing algorithm determines how the data is
routed from sender to receiver.
Arbitration and routing logic are
designed for

minimal

complexity
Low latency, (take no more than a few cycles)

PERFORMANCE PARAMETERS FOR ROUTING

ALGORITHM

Small latency

Guaranteed throughput

Path diversity

Sufficient transfer capacity

Low power consumption

Fault and distraction tolerance

Architectural requirements of scalability and

programmability

NOC ROUTING

PROBLEMS IN ROUTING

Deadlock

Livelock

Starvation

CLASSIFICATION OF ROUTING IN
NOC

Deterministic

Vs Adaptive Routing

Minimal and Non-Minimal Routing

Static and Dynamic Routing

Application Specific Routing

Minimal

Adaptive Routing

Fully Adaptive Routing

Congestion Look Ahead

Turnaround

Routing

Turn-Back-When-Possible

Odd-Even Routing

XY Routing Algorithm

OBLIVIOUS ROUTING ALGORITHMS

Dimension Order Routing

XY routing

Turn Models

West-first Routing.
North-last Routing.
Negative-first Routing

ROUTING ALGORITHMS

Deterministic Routing Algorithms

Shortest

Path Routing
Source Routing
Destination-tag Routing
Topology Adaptive Routing

Stochastic Routing Algorithms

Flooding Algorithms

DIMENSION ORDER ROUTING

XY ROUTING

XY ROUTING

Routing first in X, then in Y dimension

XY routing suits well on a network using mesh or

torus topology

Simple

Never runs deadlock

Live lock free

TURN MODELS

TURN MODELS

Turn Models
Determine

a turn or turns which are not allowed

while routing packets through a network.
live lock-free.

West-first Routing.
A

west-first routing algorithm prevents all turns to

west.
the packets going to west must be first transmitted
as far to west as necessary.
Routing packets to west is not possible later.

TURN MODELS.

North-last Routing
Turns

away from north are not possible in a northlast routing algorithm.

Thus the packets which need to be routed to north,
must be transferred there at last.

Negative-first Routing

Negative-first routing algorithm allows all other

turns except turns from positive direction to negative
direction

DETERMINISTIC ROUTING
ALGORITHMS

Deterministic routing algorithms route packets every

time from a certain point A to a certain point B along
a fixed path.

Each router has a routing table, when network

structure changes, every router has to be updated.

In congestion free networks deterministic algorithms

are reliable

low latency
No reordering

DETERMINISTIC ROUTING
ALGORITHMS..

Shortest path routing

shortest path routing is the simplest deterministic

routing algorithm.
Packets are always routed along the shortest possible
path

Source routing
In a source routing a sender makes all decisions
about a routing path of a packet.
The whole route is stored in a header of packet before
sending, and routers along the path do the routing
just like the sender has determined it.

DETERMINISTIC ROUTING
ALGORITHMS..

Destination-tag Routing
A

destination-tag routing is a bit like an inversed version of

the source routing.

The

sender stores the address of the receiver, also known as

a destination-tag, to the header of the packet in the

beginning of the routing.

Topology Adaptive Routing

The

algorithm works like a basic deterministic

algorithm .
But

Systems administrator can update the routing

tables of the routers if necessary.

STOCHASTIC ROUTING ALGORITHMS

Routing

with stochastic routing algorithms is based

on assumption that every packet sooner or later

reaches its destination.
Stochastic

algorithms are typically simple

fault-tolerant.
Throughput

of data is good

Drawbacks
quite slow
they use plenty of network resources.