Multi-Layer Channel Routing Complexity and Algorithm - PowerPoint PPT Presentation

1 / 18
About This Presentation
Title:

Multi-Layer Channel Routing Complexity and Algorithm

Description:

Algorithm for computing reduced wire length channel routing ... Trunks. Branches. Dogleg. Routing Layer Models. HV model. VH model. HVH model. VHV model ... – PowerPoint PPT presentation

Number of Views:53
Avg rating:3.0/5.0
Slides: 19
Provided by: muh2
Category:

less

Transcript and Presenter's Notes

Title: Multi-Layer Channel Routing Complexity and Algorithm


1
Multi-Layer Channel RoutingComplexity and
Algorithm
  • Rajat K. Pal

2
Chapter 4
  • A General Framework for Track Assignment in
    Multi-Layer Channel Routing

Presented By- Md. Muhidul Islam Khan ID
100705049P
3
Some Terminologies
  • Channel
  • A channel is a horizontal routing area with
    fixed pins on the top and bottom
  • NET
  • The collection of all pins with the same
    number is called a NET
  • TAH Framework
  • Algorithm for computing reduced wire length
    channel routing solutions using a purely graph
    theoretic framework, TAH (Track Assignment
    Heuristic) that was designed for computing
    minimum area routing solutions

4
Channel Routing Terminology
Terminals
Via
Upper boundary
Tracks
Dogleg
Lower boundary
Trunks
Branches
5
Routing Layer Models
1 layer
HV model
VH model
2 layers
Layer 1
Layer 2
Layer 3
Via
HVH model
VHV model
3 layers
6
  • An example channel instance of ten nets
  • Intervals of the nets are placed in five
    different tracks
  • The length of the channel (i.e., the number of
    columns) is 15
  • Arrows indicate that the terminals to be
    connected, either on the top or at the bottom, to
    complete the required interconnection of all the
    nets present in the channel

7
TAH Basics
  • The Algorithm TAH assigns intervals to tracks
    from top to bottom.
  • In the first iteration the algorithm assigns a
    set of non-overlapping intervals to the top most
    track. Then it delete the nets corresponding to
    these intervals from the channel.
  • In the second iteration it assigns a set of
    non-overlapping intervals to the second track.
  • The iterative process continues till all the nets
    are assigned to tracks in the channel.

8
10
0
1
4
1
4
9
0
5
6
7
0
10
I10
I1
I4
I9
I5
I6
I7
I3
I8
I2
2
3
2
9
7
0
3
5
5
6
8
8
9
  • The Channel contains total 10 nets
  • Density of this channel is ( ) is 5
  • Intervals of nets 1, 4, 5, 3, and 2 are
    overlapping to
  • each other, and form a clique

9
10
0
1
4
1
4
9
0
5
6
7
0
10
I10
I1
I4
I9
I5
I6
I7
I3
I8
I2
2
3
2
9
7
0
3
5
5
6
8
8
9
8
7
6
VCG
1
4
10
9
2
5
3
10
Track 1
10
0
1
4
1
4
9
0
5
6
7
0
10
I4
I10
2
3
2
9
7
0
3
5
5
6
8
8
9
8
7
6
VCG
1
9
2
5
3
11
Track 2
10
0
1
4
1
4
9
0
5
6
7
0
10
I1
I7
2
3
2
9
7
0
3
5
5
6
8
8
9
8
6
VCG
9
2
5
3
12
Track 3
10
0
1
4
1
4
9
0
5
6
7
0
10
I5
I6
I9
2
3
2
9
7
0
3
5
5
6
8
8
9
8
VCG
2
3
13
Track 4
10
0
1
4
1
4
9
0
5
6
7
0
10
I2
I8
2
3
2
9
7
0
3
5
5
6
8
8
9
VCG
3
14
Track 4
10
0
1
4
1
4
9
0
5
6
7
0
10
I2
I8
2
3
2
9
7
0
3
5
5
6
8
8
9
VCG
3
15
Track 5
10
0
1
4
1
4
9
0
5
6
7
0
10
I3
2
3
2
9
7
0
3
5
5
6
8
8
9
16
Finally using TAH
17
A Two Layer No Dog-leg routing solution for Ex.2
using TAH
18
  • Thank You
Write a Comment
User Comments (0)
About PowerShow.com