a theoretical study on wire length estimation algorithms for placement with opaque blocks tan yan*,...
TRANSCRIPT
![Page 1: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/1.jpg)
A Theoretical Study on Wire Length Estimation Algorithms for
Placement with Opaque Blocks
Tan Yan*, Shuting Li
Yasuhiro Takashima, Hiroshi Murata
The University of Kitakyushu
* Now with University of Illinois at Urbana-Champaign
![Page 2: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/2.jpg)
Motivation
“Opaque” blocks makes HPWL inexact Because of IP blocks, analog blocks, memory module… Lead to timing violation, unroutable nets…
S
THPWL
MWL
s
t
![Page 3: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/3.jpg)
Motivation—cont’d
Exact wire length estimation for Block Placement the obstacle-avoiding shortest path length
Time complexity: O(n)? O(n2)? O(nlogn)?... Time complexity is almost the same as HPWL!
Already proposed in Computational Geometry
However Not well-known in CAD community Need interpretation to be applicable to CAD!
![Page 4: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/4.jpg)
Our Contribution
We restate the results in
[P.J.de Rezende ’85] & [M.J.Atallah ’91] Simplify the discussion (with Block Placement
notions) CAD-oriented language Tailor the theory to fit into Physical Design
background
![Page 5: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/5.jpg)
Problem Formulation
Input: Block location Pin location (on block boundaries) ABLR relations * (obtainable from Sequence
Pair, etc)
Output: Rectilinear block-avoiding shortest path length
for every 2-pin net = Minimal Wire Length (MWL)
![Page 6: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/6.jpg)
Assumption
2-pin net s on S, t on T S ≠ T S is left-to T ys ≤ yt
S Ts
t
![Page 7: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/7.jpg)
Locus
v
UR locus
RU locus
![Page 8: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/8.jpg)
Theorem 1
MWL = HPWL ↔ RU locus of s goes below or through t
Proof omitted
Ss
Tt
RU locus
MWL > HPWL
Ss
Tt
RU locus
MWL = HPWL
![Page 9: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/9.jpg)
AB-region
![Page 10: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/10.jpg)
Lemma 2
There exists an MWL routing inside the AB-region
S
T
s
t
![Page 11: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/11.jpg)
Horizontal Visibility Graph (HVG)
S
T
s
t
q’s LAB
p’s RAB
(a) The RU/RD edge and the LU/LD edge (dotted edges)
(b) The corresponding routing of (a)(c) The Horizontal Visibility Graph (HVG)
of net (s,t)
p
q
p
q
![Page 12: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/12.jpg)
MWL = shortest path length
Only linear number of edges, but still captures MWL!
S
T
s
t
Lemma 4: There exists a path (s,t) on the visibility graph that corresponds to an MWL routing.
![Page 13: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/13.jpg)
Visibility graph of a placement
![Page 14: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/14.jpg)
The overall flow
and so on …
![Page 15: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/15.jpg)
Time complexity
M = # of blocks, N = # of netsBuilding visibility graph:
O(M logM)
Estimating one net: O(M)
Total: O(M logM + NM) Shortest path on channel graph takes O(NM2)
![Page 16: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/16.jpg)
Use LUT to enhance the speed
Blocks in between
S2
AT1
s2t1
BS1s1
T2t2
a1
a2
b1
b2
No path between two vertices? (a2b2)
Need to judge whether RU locus above t ? How to find out A & B promptly?
![Page 17: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/17.jpg)
Two lemmas:
Lemma 5: Two vertices s and t on visibility graph. If there is no path between them, then MWL = HPWL
Lemma 6: If t is above s’s RU locus and there exists a shortest path between them, then its length = HPWL.
a
b
c
d MWL(a,b) = HPWL
ShortestPath(c,d)
= MWL (c,d) = HPWL
![Page 18: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/18.jpg)
Theorem 3
The MWL of any two vertices on the visibility graph can be obtained by shortest path algorithm: Shortest path exists, MWL = path length Otherwise, MWL = HPWL
![Page 19: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/19.jpg)
How it works
MWL = shortest path length
No path!
MWL = HPWL
And so on…
Lookup table
![Page 20: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/20.jpg)
Time complexity
Building LUT: O(M2)
Estimating one net: O(1)
Total: O(M2+N) Almost the same as HPWL!
![Page 21: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/21.jpg)
Future works
Integration of routing congestionExtension to handle multi-pin netsApplication to global routerExperimental study
![Page 22: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/22.jpg)
Thank you!
Q & A
![Page 23: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/23.jpg)
Proof of Theorem 1
MWL = HPWL ↔ RU locus of s goes below or through t
Ss
Tt
Ss
Tt
(c) The light gray blocks makes S below T
(d) If RU locus and DL locus intersect, then there exists a HPWL routing
RU locus
DL locus
Ss
Tt
RU locus
(b) No HPWL routing exists if the RU locus of s goes above t
![Page 24: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/24.jpg)
Proof of Lemma 2
There exists an MWL routing completely inside AB-region
S
T
s
t
s’
t’
![Page 25: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/25.jpg)
Proof of Lemma 4
There exists a path p from s to t on HVG that corresponds to an MWL routing.
S
T
s
t
v
v
![Page 26: A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks Tan Yan*, Shuting Li Yasuhiro Takashima, Hiroshi Murata The University](https://reader033.vdocuments.net/reader033/viewer/2022061306/551477a1550346b0158b5378/html5/thumbnails/26.jpg)
Proof of Lemma 6
If t is above s’s RU locus and there exists a shortest path between them, then its length = HPWL.
s
u
t
w
v s
u
t
z
(a) u’s RU locus goes below t (b) u’s RU locus goes above t