Presentation is loading. Please wait.

Presentation is loading. Please wait.

Capo: Robust and Scalable Open-Source Min-cut Floorplacer Jarrod A. Roy, David A. Papa,Saurabh N. Adya, Hayward H. Chan, James F. Lu, Aaron N. Ng, Igor.

Published byDarrion Cantley Modified over 10 years ago

Similar presentations

Presentation on theme: "Capo: Robust and Scalable Open-Source Min-cut Floorplacer Jarrod A. Roy, David A. Papa,Saurabh N. Adya, Hayward H. Chan, James F. Lu, Aaron N. Ng, Igor."— Presentation transcript:

1 Capo: Robust and Scalable Open-Source Min-cut Floorplacer Jarrod A. Roy, David A. Papa,Saurabh N. Adya, Hayward H. Chan, James F. Lu, Aaron N. Ng, Igor L. Markov EECS Department University of Michigan, Ann Arbor Credits for original Capo: Caldwell, Kahng & Markov http://vlsicad.eecs.umich.edu/BK/PDtools/tar.gz/LATEST/

2 Original Motivation (ca 2000) Co-developed at UCLA with Andy Caldwell under the guidance of Andrew Kahng –First fixed-die placer in the literature –First academic placer using multi-level partitioning (MLPart) –First academic placer in the US to compete heads-on with commercial placers on large industrial netlists –All code written from scratch Capo - an experiment in min-cut placement DAC 2000: Can Recursive Bisection Alone Produce Routable Placements ? –Message: minimizing HPWL is not enough

3 Min-cut Bisection

4 Basic Components & Techniques Overall runtime O(P (log P) 2 ) Three min-cut partitioners –MLPart and FMPart (heur.) & BBPart (optimal) ASPDAC 2000, JEA 2000, ISPD `98/TCAD `01 –Capo makes several different calls to MLPart every time (some are Vcycling) Shifting cut-lines (not a grid): ASIC `98 Optimal end-case placers (B&B): ISPD `98 –Also used in detail placement RowIroning Uniform whitespace allocation: TCAD `03 Non-uniform whitespace allocation: ICCAD `03 Feedback / cycling (Kahng & Reda, DAC `04)

5 Capos Distinctive Features (can be found in some industry tools, but rarely in academic placers) Global placement with Capo often produces legal placements –No cell-shifting / legalization is necessary –Top-down estimates of cell locations and interconnect are very accurate –This seems to improve generic routability –Ensured robust handling of obstacles since 2000 Can make any netlist routable by more generous floorplan (greater whitespace) –Request uniform whitespace distribution! Very low via counts

6 The Integration of Block-packing (using Parquet) ICCAD `04

7 Advanced Details Weighted terminal propagation –Described in a TR by Karypis & Selvakkumaran –More accurate capture of HPWL in min-cut partitioning –Nets with terminals too close to cut-line have cost <1 –Some orig. nets are modeled by two nets for min-cut To improve terminal propagation, use an SOR-based quadratic placer after every round of partitioning –Also tried ACG (Alpert, Nam & Villarrubia; ICCAD`03) Look-ahead criteria for Parquet were sharpened

8 Recent Improvements Whitespace allocation rewritten entirely –New params: -minLocalWS and -safeWS Cutline positioning relative to obstacles –Feature locations are corners of fixed macros –Among those, we minimize cutlength –Cutline direction is selected based on cutlength MLPart & FMPart are 2x faster (loop unroling) –Also, bugfix in Vcycling –Also, variable-effort partitioning in Capo Stronger, much faster RowIroning Stronger macro legalizer, more scalable cell leg. Meta-options: -faster and -tryHarder

9 Large-scale Visualization Example: different whitespace allocation modes Plots of large designs with data compression –Less than 1 bit per cell –The plotter is in the GSRC bookshelf under PlaceUtils

10 Capo Memory & Runtime Data with –faster (Opteron @2.8GHz, Linux) 7h40m 17 mins

11 Example of Self-profiling in Capo MLPart took: 9360.9sec (39.25%) FMPart took: 661.4sec (2.77%) BBPart took: 255.3sec (1.07%) SmPlace took: 1727.6sec (7.24%) ProblemSetup took: 11365.5sec (47.66%) SmPlProbSetup took: 133.5sec (0.56%) Level Stats took: 151.2sec (0.63%) Total runtime of measured components: 23657.1sec (99.2%) MLPart took: 396.06sec (51.58%) FMPart took: 38.29sec (4.99%) BBPart took: 20.13sec (2.62%) SmPlace took: 139.14sec (18.12%) ProblemSetup took 151.01sec (19.67%) SmPlProbSetup took: 4.85sec (0.63%) Level Stats took: 10.79sec (1.41%) Total runtime of measured components: 760.43sec (99.03%) Adaptec 1 (250K) Big Blue 4 (2.1M) RowIroning takes additional 10-15% by runtime

12 Infrastructure Available in GSRC Bookshelf (April 2005) Source code & binaries –Converters: Bookshelf to/from LEFDEF –Gnuplotter with data compression –Macro & cell legalizer –Improved stand-alone RowIroning –Complete Capo 9.1 (with MLPart) for Linux (32/64), Solaris (32/64) and Windows http://vlsicad.eecs.umich.edu/BK/PDtools/ Compatible with OpenAccess Ongoing work on further improvements

13 Example: Whats Wrong Here?

Download ppt "Capo: Robust and Scalable Open-Source Min-cut Floorplacer Jarrod A. Roy, David A. Papa,Saurabh N. Adya, Hayward H. Chan, James F. Lu, Aaron N. Ng, Igor."

Similar presentations

Constraint Driven I/O Planning and Placement for Chip-package Co-design Jinjun Xiong, Yiuchung Wong, Egino Sarto, Lei He University of California, Los.

Constraint Driven I/O Planning and Placement for Chip-package Co-design Jinjun Xiong, Yiuchung Wong, Egino Sarto, Lei He University of California, Los.
Natarajan Viswanathan Min Pan Chris Chu Iowa State University International Symposium on Physical Design April 6, 2005 FastPlace: An Analytical Placer.

Natarajan Viswanathan Min Pan Chris Chu Iowa State University International Symposium on Physical Design April 6, 2005 FastPlace: An Analytical Placer.
X-Architecture Placement Based on Effective Wire Models Tung-Chieh Chen, Yi-Lin Chuang, and Yao-Wen Chang Graduate Institute of Electronics Engineering.

X-Architecture Placement Based on Effective Wire Models Tung-Chieh Chen, Yi-Lin Chuang, and Yao-Wen Chang Graduate Institute of Electronics Engineering.
Shuai Li and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University West Lafayette, IN, 47907-2035 Mixed Integer Programming Models.

Shuai Li and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University West Lafayette, IN, Mixed Integer Programming Models.
Ripple: An Effective Routability-Driven Placer by Iterative Cell Movement Xu He, Tao Huang, Linfu Xiao, Haitong Tian, Guxin Cui and Evangeline F.Y. Young.

Ripple: An Effective Routability-Driven Placer by Iterative Cell Movement Xu He, Tao Huang, Linfu Xiao, Haitong Tian, Guxin Cui and Evangeline F.Y. Young.
SimPL: An Effective Placement Algorithm Myung-Chul Kim, Dong-Jin Lee and Igor L. Markov Dept. of EECS, University of Michigan 1ICCAD 2010, Myung-Chul Kim,

SimPL: An Effective Placement Algorithm Myung-Chul Kim, Dong-Jin Lee and Igor L. Markov Dept. of EECS, University of Michigan 1ICCAD 2010, Myung-Chul Kim,
1 Physical Hierarchy Generation with Routing Congestion Control Chin-Chih Chang *, Jason Cong *, Zhigang (David) Pan +, and Xin Yuan * * UCLA Computer.

1 Physical Hierarchy Generation with Routing Congestion Control Chin-Chih Chang *, Jason Cong *, Zhigang (David) Pan +, and Xin Yuan * * UCLA Computer.
Consistent Placement of Macro-Blocks Using Floorplanning and Standard-Cell Placement Saurabh Adya Igor Markov (University of Michigan)

Consistent Placement of Macro-Blocks Using Floorplanning and Standard-Cell Placement Saurabh Adya Igor Markov (University of Michigan)
FastPlace: Efficient Analytical Placement using Cell Shifting, Iterative Local Refinement and a Hybrid Net Model FastPlace: Efficient Analytical Placement.

FastPlace: Efficient Analytical Placement using Cell Shifting, Iterative Local Refinement and a Hybrid Net Model FastPlace: Efficient Analytical Placement.
Intrinsic Shortest Path Length: A New, Accurate A Priori Wirelength Estimator Andrew B. KahngSherief Reda VLSI CAD Laboratory.

Intrinsic Shortest Path Length: A New, Accurate A Priori Wirelength Estimator Andrew B. KahngSherief Reda VLSI CAD Laboratory.
APLACE: A General and Extensible Large-Scale Placer Andrew B. KahngSherief Reda Qinke Wang VLSICAD lab University of CA, San Diego.

APLACE: A General and Extensible Large-Scale Placer Andrew B. KahngSherief Reda Qinke Wang VLSICAD lab University of CA, San Diego.
Boosting: Min-Cut Placement with Improved Signal Delay Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA 92093.

Boosting: Min-Cut Placement with Improved Signal Delay Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA
Constructive Benchmarking for Placement David A. Papa EECS Department University of Michigan Ann Arbor, MI 48109 Igor L. Markov EECS.

Constructive Benchmarking for Placement David A. Papa EECS Department University of Michigan Ann Arbor, MI Igor L. Markov EECS.
Faster SAT and Smaller BDDs via Common Function Structure Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah University of Michigan.

Faster SAT and Smaller BDDs via Common Function Structure Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah University of Michigan.
Fixed-outline Floorplanning Through Better Local Search

Fixed-outline Floorplanning Through Better Local Search
Benchmarking for Large-Scale Placement and Beyond S. N. Adya, M. C. Yildiz, I. L. Markov, P. G. Villarrubia, P. N. Parakh, P. H. Madden.

Benchmarking for Large-Scale Placement and Beyond S. N. Adya, M. C. Yildiz, I. L. Markov, P. G. Villarrubia, P. N. Parakh, P. H. Madden.
An Analytic Placer for Mixed-Size Placement and Timing-Driven Placement Andrew B. Kahng and Qinke Wang UCSD CSE Department {abk, Work.

An Analytic Placer for Mixed-Size Placement and Timing-Driven Placement Andrew B. Kahng and Qinke Wang UCSD CSE Department {abk, Work.
Stability and Scalability in Global Routing S. K. Han 1, K. Jeong 1, A. B. Kahng 1,2 and J. Lu 2 1 ECE Department, UC San Diego 2 CSE Department, UC San.

Stability and Scalability in Global Routing S. K. Han 1, K. Jeong 1, A. B. Kahng 1,2 and J. Lu 2 1 ECE Department, UC San Diego 2 CSE Department, UC San.
Andrew Kahng – November 2002 ICCAD-2002 Open Source Panel Andrew B. Kahng UC San Diego CSE & ECE Depts. Igor L. Markov Univ. of Michigan EECS Dept.

Andrew Kahng – November 2002 ICCAD-2002 Open Source Panel Andrew B. Kahng UC San Diego CSE & ECE Depts. Igor L. Markov Univ. of Michigan EECS Dept.
A Semi-Persistent Clustering Technique for VLSI Circuit Placement Charles J. Alpert 1, Andrew Kahng 2, Gi-Joon Nam 1, Sherief Reda 2 and Paul G. Villarrubia.

A Semi-Persistent Clustering Technique for VLSI Circuit Placement Charles J. Alpert 1, Andrew Kahng 2, Gi-Joon Nam 1, Sherief Reda 2 and Paul G. Villarrubia.

Similar presentations

Ads by Google