View
225
Download
7
Tags:
Embed Size (px)
Citation preview
Multi-Layer Channel RoutingComplexity and Algorithm
- Rajat K. Pal
Md. Jawaherul Alam#040805062P
Presented by
Section 5.3: NP-completeness ofMulti-Layer No-dogleg Routing
Channel
Area minimization requires number of track minimization
The channel routing problem is the problem ofcomputing a feasible route for the nets so that
the number of tracks required is minimized
Channel Routing Problem
1 4 0 6 0 3 3 9 7 0 3 2 0 0 5 0 0 0 5
4 0 6 0 4 1 8 2 0 9 0 0 8 3 0 0 7 0 5
I4 I8
I9
I2
I1
I3
I7I5
I6
Parameters in No-dogleg Routing
1 4 0 6 0 3 3 9 7 0 3 2 0 0 5 0 0 0 5
4 0 6 0 4 1 8 2 0 9 0 0 8 3 0 0 7 0 5
I4 I8
I9
I2
I1
I3
I7I5
I6
Parameters in No-dogleg Routing
Column density =3
Column density =5
More horizontal layers: HVH routing
dmax = maximum
column density
Lower bound on #
tracks
2 3 3
3 20
1
1
Parameters in No-dogleg Routing
2
3
1
VCG
vmax = longest path
length + 1
Lower bound on # tracksMore vertical
layers: VHV routing
Parameters in No-dogleg Routing
2
3
1VCG
2 1 3
3 20
2
1
Not possible in no-dogleg VH routing
Possible in no-dogleg VHV
routing
VHVH Routing
2 1 3
3 20
2
1
V1
V2
H2H1
Tracks on H1 layer has VHV routing
Tracks on H2 layer has VH routing
NP completeness
A decision problem X is NP-complete if
X NP, i.e. for any yes instance I of X, there is a polynomial (in I ) sized certificate,
which can be verified in polynomial ( in I ) time.
A polynomial-time solution of X implies a polynomial-time solution of any problem X’
NP.
Polynomial-time
reducibility
Polynomial-time Reducibility from X’ to X
Any instance I’ of X’
An instance I of X
Size of I is in polynomial of
I’
Polynomial-time
A solution of I
Polynomial-timeA solution of
I’
Solution of X
Any instance I’ of X’
Polynomial-tim
e
A solution of I’
3-SAT problem
U= { a, b, c, d } : a set of literals
F = ( b + c + d )( d + b + a )( a + b + c ) : Logical AND of q number of 3-element clauses,
each element in U
Is there a truth assignment of U that satisfies F ?
a
b
c
d
F
Is there a truth
assignment of a,b,c,d
that makes F=1 ?NP-complete
IS3 problem
A undirected graph G = ( V, E ) with n vertices
Is there an independent set of size n/3 ?
IS2 problem
A undirected graph G = ( V, E ) with n vertices
Is there an independent set of size n/2 ?
ISi problem; i ≥ 4
A undirected graph G = ( V, E ) with n vertices
Is there an independent set of size n/i ?
MNVHVH problem
Channel specification of multi-terminal net
Is there a four layer VHVH routing solution for the given instance using
dmax/2 tracks?
Multi-terminal no-dogleg VHVH channel routing
MNVHVHk problem
Channel specification of multi-terminal net
Is there a four layer VHVH routing solution for the given instance using k
tracks?
MNVHVHVH ( MNVHVHVHk ) problem
Channel specification of multi-terminal net
Is there a four layer VHVHVH routing solution for the given instance using
dmax/3 ( k ) tracks?
MNViHi ( MNViHik ) problem
Channel specification of multi-terminal net
Is there a four layer ViHi routing
solution for the given instance using dmax/i ( k ) tracks?
MNViHi+1 ( MNViHi+1k ) problem
Channel specification of multi-terminal net
Is there a four layer ViHi+1 routing
solution for the given instance using dmax/(i+1) ( k ) tracks?
IS3 is NP-complete
• IS3 NP : trivialGiven a guess of n/3 vertices,
check whether they are independent
A undirected graph G with n
verticesIs there an
independent set of size n/3 ?
• IS3 is NP-completeReduction from 3-SAT problem
U= { a, b, c, d }F = ( b + c + d )( d + b + a )( a + b + c )
IS3 is NP-complete
b
d
!c
!d
!ba
c
b !a
G(F)
F is satisfiable if and only if G(F) has an independent size
of size q
q clauses
3q vertices
U= { a, b, c, d }F = ( b + c + d )( d + b + a )( a + b + c )
IS3 is NP-complete
b
d
!c
!d
!ba
c
b !a
G(F)
q clauses
3q vertices
F is satisfiable if and only if G(F) has an independent size
of size qa=0, b=1, c=0, d=0F= 1
U= { a, b, c, d }F = ( b + c + d )( d + b + a )( a + b + c )
IS3 is NP-complete
b
d
!c
!d
!ba
c
b !a
G(F)
q clauses
3q vertices
a=0, b=1, c=0, d=0F= 1
b, !d, !a
U= { a, b, c, d }F = ( b + c + d )( d + b + a )( a + b + c )
IS3 is NP-complete
b
d
!c
!d
!ba
c
b !a
G(F)
q clauses
3q vertices
a=1, c=1, d=1
U= { a, b, c, d }F = ( b + c + d )( d + b + a )( a + b + c )
U= { a, b, c, d }F = ( b + c + d )( d + b + a )( a + b + c )
IS2 is NP-complete
b
d
!c
!d
!ba
c
b !a
G(F)
F is satisfiable if and only if G(F)
has an independent size
of size 2q
q clauses
3q vertices
q vertices
4q vertices
U= { a, b, c, d }F = ( b + c + d )( d + b + a )( a + b + c )
ISi is NP-complete
b
d
!c
!d
!ba
c
b !a
G(F)
q clauses
3q vertices
K(i-3)q+i
iq+i vertices
F is satisfiable if and only if G(F) has an independent size
of size q+1
• MNVHVH NP Given a guess of a feasible routing
solution of an instance of MNVHVH, verify whether the guess is a valid solution
• MNVHVH is NP-completeReduction from IS2 problem
MNVHVH is NP-complete
34
21
G
MNVHVH is NP-complete
0 0 0 0 1 2 3 1 1 4 3 4 2 4 1 2 3 4
1 2 3 4 2 1 1 3 4 1 4 3 4 2 0 0 0 0
I2
I1
I3
I4
L RM
dmax = nVCG
34
21
G has an independent set of size n/2 if and only if the net has a
VHVH routing with n/2 tracks
34
21
G
MNVHVH is NP-complete
0 0 0 0 1 2 3 1 1 4 3 4 2 4 1 2 3 4
1 2 3 4 2 1 1 3 4 1 4 3 4 2 0 0 0 0
I2
I1
I3
I4
L RM
dmax = nVCG
4
1
G has an independent set of size n/2 if and only if the net has a
VHVH routing with n/2 tracks
3
2
34
21
G
MNVHVH is NP-complete
0 0 0 0 1 2 3 1 1 4 3 4 2 4 1 2 3 4
1 2 3 4 2 1 1 3 4 1 4 3 4 2 0 0 0 0
I2
I1
I3
I4
L RM
dmax = nVCG
4
1
3
2
2 3
3 2
34
21
G
MNVHVH is NP-complete
0 0 0 0 1 2 3 1 1 4 3 4 2 4 1 2 3 4
1 2 3 4 2 1 1 3 4 1 4 3 4 2 0 0 0 0
I2
I1
I3
I4
L RM
dmax = nVCG
4
1
3
2
2 3
3 2
34
21
G
MNVHVH is NP-complete
0 0 0 0 1 2 3 1 1 4 3 4 2 4 1 2 3 4
1 2 3 4 2 1 1 3 4 1 4 3 4 2 0 0 0 0
I2
I3
L RM
dmax = nVCG
4
1
3
2
2 3
3 2