MAPLE: multilevel adaptive placement for mixed-size designs

We propose a new multilevel framework for large-scale placement called MAPLE that respects utilization constraints, handles movable macros and guides the transition between global and detailed placement. In this framework, optimization is adaptive to current placement conditions through a new density metric. As a baseline, we leverage a recently developed at quadratic optimization that is comparable to prior multilevel frameworks in quality and runtime. A novel component called Progressive Local Refinement (ProLR) helps mitigate disruptions in wirelength that we observed in leading placers. Our placer MAPLE outperforms published empirical results --- RQL, SimPL, mPL6, NTUPlace3, FastPlace3, Kraftwerk and APlace3 -- across the ISPD 2005 and ISPD 2006 benchmarks, in terms of official metrics of the respective contests.

[1]  Igor L. Markov,et al.  Solving hard instances of floorplacement , 2006, ISPD '06.

[2]  Chris C. N. Chu,et al.  FastPlace 3.0: A Fast Multilevel Quadratic Placement Algorithm with Placement Congestion Control , 2007, 2007 Asia and South Pacific Design Automation Conference.

[3]  Ulf Schlichtmann,et al.  Kraftwerk2—A Fast Force-Directed Quadratic Placement Approach Using an Accurate Net Model , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Konrad Doll,et al.  Analytical placement: a linear or a quadratic objective function? , 1991, 28th ACM/IEEE Design Automation Conference.

[5]  Igor L. Markov,et al.  Smoothening Max-terms and Analytical Minimization of Half-Perimeter Wirelength , 2022 .

[6]  Andrew B. Kahng,et al.  An algebraic multigrid solver for analytical placement with layout based clustering , 2003, DAC '03.

[7]  M. Marek-Sadowska,et al.  mFAR: fixed-points-addition-based VLSI placement algorithm , 2005, ISPD '05.

[8]  Tao Huang,et al.  Ripple: An effective routability-driven placer by iterative cell movement , 2011, 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[9]  Chris C. N. Chu,et al.  RQL: Global Placement via Relaxed Quadratic Spreading and Linearization , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[10]  Joseph R. Shinnerl,et al.  mPL6: enhanced multilevel mixed-size placement , 2006, ISPD '06.

[11]  Yao-Wen Chang,et al.  NTUplace3: An Analytical Placer for Large-Scale Mixed-Size Designs With Preplaced Blocks and Density Constraints , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Jens Vygen,et al.  BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Jason Cong,et al.  Modern Circuit Placement, Best Practices and Results , 2007 .

[14]  Natarajan Viswanathan,et al.  The DAC 2012 routability-driven placement contest and benchmark suite , 2012, DAC Design Automation Conference 2012.

[15]  Andrew B. Kahng,et al.  A faster implementation of APlace , 2006, ISPD '06.

[16]  Jason Cong,et al.  Multilevel generalized force-directed method for circuit placement , 2005, ISPD '05.

[17]  Chris C. N. Chu,et al.  An efficient and effective detailed placement algorithm , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[18]  Jin Hu,et al.  A SimPLR method for routability-driven placement , 2011, 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[19]  Chris C. N. Chu,et al.  FastPlace 2.0: an efficient analytical placer for mixed-mode designs , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[20]  Yao-Wen Chang,et al.  MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  Andrew B. Kahng,et al.  A semi-persistent clustering technique for VLSI circuit placement , 2005, ISPD '05.

[22]  Georg Sigl,et al.  GORDIAN: VLSI placement by quadratic programming and slicing optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[23]  Dongjin Lee,et al.  SimPL: An Effective Placement Algorithm , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[24]  Yao-Wen Chang,et al.  Routability-driven analytical placement for mixed-size circuit designs , 2011, 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[25]  Andrew B. Kahng,et al.  Implementation and extensibility of an analytic placer , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[26]  Yao-Wen Chang,et al.  MP-trees: A Packing-Based Macro Placement Algorithm for Mixed-Size Designs , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[27]  Andrew B. Kahng,et al.  On wirelength estimations for row-based placement , 1998, ISPD '98.

[28]  Dongjin Lee,et al.  Obstacle-Aware Clock-Tree Shaping During Placement , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[29]  Gi-Joon Nam,et al.  Techniques for Fast Physical Synthesis , 2007, Proceedings of the IEEE.

[30]  Jarrod A. Roy,et al.  The ISPD-2011 routability-driven placement contest and benchmark suite , 2011, ISPD '11.

[31]  Yao-Wen Chang,et al.  Constraint graph-based macro placement for modern mixed-size circuit designs , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.