EE382V Fall 2008
VLSI Physical Design Automation
Lecture 9. Introduction to Routing;
Global Routing (I)
Prof. David Pan
dpan@[Link]
Office: ACES 5.434
03/16/16
Introduction to Routing
03/16/16
Routing in design flow
B
A
Netlist
INV
Routing
AND
OR
Floorplan/Placement
03/16/16
The Routing Problem
Apply it after floorplanning/placement
Input:
Netlist
Timing budget for, typically, critical nets
Locations of blocks and locations of pins
Output:
Geometric layouts of all nets
Objective:
Minimize the total wire length, the number of vias, or just
completing all connections without increasing the chip area.
Each net meets its timing budget.
03/16/16
The Routing Constraints
Examples:
Placement constraint
Number of routing layers
Delay constraint
Meet all geometrical constraints (design rules)
Physical/Electrical/Manufacturing constraints:
Crosstalk
Process variations, yield, or lithography issues?
03/16/16
Steiner Tree
For a multi-terminal net, we can construct a
spanning tree to connect all the terminals
together.
But the wire length will be large.
Better use Steiner Tree:
A tree connecting all terminals and some
additional nodes (Steiner nodes).
Steiner
Node
Rectilinear Steiner Tree:
Steiner tree in which all the edges run horizontally
and vertically.
03/16/16
Routing Problem is Very Hard
Minimum Steiner Tree Problem:
Given a net, find the Steiner tree with the minimum length.
This problem is NP-Complete!
May need to route tens of thousands of nets
simultaneously without overlapping.
Obstacles may exist in the routing region.
03/16/16
Kinds of Routing
Global Routing
Detailed Routing
Channel
Switchbox
Others:
Maze routing
Over the cell routing
Clock routing
03/16/16
Approaches for Routing
Sequential Approach:
Route nets one at a time.
Order depends on factors like criticality, estimated wire length, and
number of terminals.
When further routing of nets is not possible because some nets
are blocked by nets routed earlier, apply Rip-up and Reroute
technique (or Shove-aside technique).
Concurrent Approach:
Consider all nets simultaneously, i.e., no ordering.
Can be formulated as integer programming.
03/16/16
Classification of Routing
03/16/16
10
General Routing Paradigm
Two phases:
03/16/16
11
Extraction and Timing Analysis
After global routing and detailed routing, information of
the nets can be extracted and delays can be analyzed.
If some nets fail to meet their timing budget, detailed
routing and/or global routing needs to be repeated.
03/16/16
12
Global Routing
Global routing is divided into 3 phases:
1. Region definition
2. Region assignment
3. Pin assignment to routing regions
03/16/16
13
Region Definition
Divide the routing area into routing regions of simple shape
(rectangular):
Switchbox
Channel
Channel: Pins on 2 opposite sides.
2-D Switchbox: Pins on 4 sides.
3-D Switchbox: Pins on all 6 sides.
03/16/16
14
Routing Regions
03/16/16
15
Routing Regions in
Different Design Styles
Gate-Array
Standard-Cell
Full-Custom
Feedthrough Cell
03/16/16
16
Region Assignment
Assign routing regions to each net. Need to consider timing
budget of nets and routing congestion of the regions.
03/16/16
17
Graph Modeling of
Routing Regions
Grid Graph Modeling
Checker Board Graph Modeling
Channel Intersection Graph Modeling
03/16/16
18
Grid Graph
A terminal
A node with terminals
03/16/16
19
Checker Board Graph
capacity
1
2
1
2
1
1
1
1
A node with terminals
A terminal
03/16/16
20
Channel Intersection Graph
A node with terminals
A terminal
Routings along the channels
03/16/16
21
Approaches for Global Routing
Sequential Approach:
Route the nets one at a time.
Order dependent on factors like criticality, estimated wire
length, etc.
If further routing is impossible because some nets are
blocked by nets routed earlier, apply Rip-up and Reroute
technique.
This approach is much more popular.
03/16/16
22
Approaches for Global Routing
Concurrent Approach:
Consider all nets simultaneously.
Can be formulated as an integer program.
03/16/16
23
Pin Assignment
Assign pins on routing region boundaries for each net.
(Prepare for the detailed routing stage for each region.)
03/16/16
24
03/16/16
25
Maze Routing
03/16/16
26
Maze Routing Problem
Given:
A planar rectangular grid graph.
Two points S and T on the graph.
Obstacles modeled as blocked vertices.
Objective:
Find the shortest path connecting S and T.
This technique can be used in global or detailed
routing (switchbox) problems.
03/16/16
27
Grid Graph
S
S
T
Area Routing
X
X
Grid Graph
(Maze)
03/16/16
X
X
Simplified
Representation
28
Maze Routing
S
T
03/16/16
29
Lees Algorithm
An
Algorithm for Path Connection and its Application,
C.Y. Lee, IRE Transactions on Electronic Computers,
1961.
03/16/16
30
Basic Idea
A Breadth-First Search (BFS) of the grid graph.
Always find the shortest path possible.
Consists of two phases:
Wave Propagation
Retrace
03/16/16
31
An Illustration
S
03/16/16
3
5
T
32
Wave Propagation
At step k, all vertices at Manhattan-distance k from S
are labeled with k.
A Propagation List (FIFO) is used to keep track of the
vertices to be considered next.
3
T
After Step 0
After
Step 3
03/16/16
3
5
T
After Step 6
6
33
Retrace
Trace back the actual route.
Starting from T.
At vertex with k, go to any vertex with label k-1.
S
3
5
T
Final labeling
03/16/16
34
How many grids visited using Lees algorithm?
13 121110
7 6 7 7
9 10
12 1110 9
8 9 101112
6 5 6 7
1110 9 8 7 6 5 4
7 8 9 1011
10 9 8 7 6 5 4 3
6 7 8 9 10
7 6 54 3 2 1 2 3 4 5 67 8 9
6 5 4 3 2 1 S1 23 4 5 6 7 8
3 2 1 2 3 4 5 6 78 9
9 8 7 6
10 9 8 7
3 5 6 7 8 9 10
1110 9 8 9 10
7 6 7 8 9 1011
12 11
10 11121110 9 8
9 101112
11121312 1110 9
13 12
10111213
12 13 1312 1110
111213
13
13 1211
1213
1312 T 13
13
03/16/16
35
Time and Space Complexity
For a grid structure of size w h:
Time per net = O(wh)
Space = O(wh log wh) (O(log wh) bits are needed to store
each label.)
For a 4000 4000 grid structure:
24 bits per label
Total 48 Mbytes of memory!
03/16/16
36
Improvement to Lees Algorithm
Improvement on memory:
Akers Coding Scheme
Improvement on run time:
Starting point selection
Double fan-out
Framing
Hadlocks Algorithm
Soukups Algorithm
03/16/16
37
Akers Coding Scheme
to Reduce Memory Usage
03/16/16
38
Akers Coding Scheme
For the Lees algorithm, labels are needed during
the retrace phase.
But there are only two possible labels for neighbors
of each vertex labeled i, which are, i-1 and i+1.
So, is there any method to reduce the memory
usage?
03/16/16
39
Akers Coding Scheme
One bit (independent of grid size) is enough to
distinguish between the two labels.
Sequence:
... (what sequence?)
(Note: In the sequence, the
labels before and after each
label must be different in
order to tell the forward or
the backward directions.)
03/16/16
40
Schemes to Reduce Run Time
1. Starting Point Selection:
T
S
S
2. Double Fan-Out:
T
3. Framing:
S
T
T
03/16/16
41
Hadlocks Algorithm
to Reduce Run Time
03/16/16
42
Detour Number
For a path P from S to T, let detour number d(P) = # of
grids directed away from T, then
L(P) = MD(S,T) + 2d(P)
length
D
D
D
S
T
shortest Manhattan distance
D: Detour
d(P) = 3
MD(S,T) = 6
L(P) = 6+2x3 = 12
03/16/16
So minimizing L(P) and d(P)
are the same.
43
Hadlocks Algorithm
Label vertices with detour numbers.
Vertices with smaller detour number are expanded
first.
Therefore, favor paths without detour.
3
2
1
1
1
2
3
2
1
S
0
0
1
2
2 2 2 2 2
1
2 2
2
0
0
0
2 T
1
2 2
2 2 2 2
03/16/16
44
Soukups Algorithm
to Reduce Run Time
03/16/16
45
Basic Idea
Soukups Algorithm: BFS+DFS
Explore in the direction towards the target without changing
direction. (DFS)
If obstacle is hit, search around the obstacle. (BFS)
May get Sub-Optimal solution.
2
2 1
1 S 1
1
1
1
2 1 1
2 2
03/16/16
46
How many grids visited using Hadlocks?
T
03/16/16
47
How many grids visited using Soukups?
T
03/16/16
48
Multi-Terminal Nets
For a k-terminal net, connect the k terminals using a
rectilinear Steiner tree with the shortest wire length on
the maze.
This problem is NP-Complete.
Just want to find some good heuristics.
03/16/16
49
Multi-Terminal Nets
This problem can be solved by extending the Lees
algorithm:
Connect one terminal at a time, or
Search for several targets simultaneously, or
Propagate wave fronts from several different sources
simultaneously.
03/16/16
50
Extension to Multi-Terminal Nets
1st Iteration
S
2 T3
2nd Iteration
S
0 S0 S0 S0
1
03/16/16
51