Solving modern mixed-size placement instances

Physical design of modern systems-on-chip is extremely challenging. Such digital integrated circuits often contain tens of millions of logic gates, intellectual property blocks, embedded memories and custom register-transfer level (RTL) blocks. At current and future technology nodes, their power and performance are impacted, more than ever, by the placement of their modules. However, our experiments show that traditional techniques for placement and floorplanning, and existing academic tools cannot reliably solve the placement task. To study this problem, we identify particularly difficult industrial instances and reproduce the failures of existing tools by modifying pre-existing benchmark instances. Furthermore, we propose algorithms that facilitate placement of these difficult instances. Empirically, our techniques consistently produce legal placements, and on instances where comparison is possible, reduce wirelength by 13% over Capo 9.4 and 31% over PATOMA 1.0-the pre-existing tools that most frequently produce legal placements in our experiments.

[1]  Andrew B. Kahng,et al.  An analytic placer for mixed-size placement and timing-driven placement , 2004, ICCAD 2004.

[2]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.

[3]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.

[4]  Jarrod A. Roy,et al.  Min-cut floorplacement , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[6]  Charles J. Alpert,et al.  The ISPD98 circuit benchmark suite , 1998, ISPD '98.

[7]  Joseph R. Shinnerl,et al.  Robust mixed-size placement under tight white-space constraints , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[8]  Andrew V. Goldberg,et al.  An efficient implementation of a scaling minimum-cost flow algorithm , 1993, IPCO.

[9]  Andrew A. Kennings,et al.  An improved multi-level framework for force-directed placement , 2005, Design, Automation and Test in Europe.

[10]  Gi-Joon Nam,et al.  Effective free space management for cut-based placement via analytical constraint generation , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Jason Cong,et al.  Multi-level placement for large-scale mixed-size IC designs , 2003, ASP-DAC '03.

[12]  Andrew B. Kahng,et al.  Classical floorplanning harmful? , 2000, ISPD '00.

[13]  Sherief Reda,et al.  Effective linear programming based placement methods , 2006, ISPD '06.

[14]  Gi-Joon Nam,et al.  The ISPD2005 placement contest and benchmark suite , 2005, ISPD '05.

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

[16]  Igor L. Markov,et al.  Fixed-outline floorplanning: enabling hierarchical design , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[17]  Andrew B. Kahng,et al.  Architecture and details of a high quality, large-scale analytical placer , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[18]  Martin D. F. Wong,et al.  Optimal redistribution of white space for wire length minimization , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[19]  Jarrod A. Roy,et al.  Capo: robust and scalable open-source min-cut floorplacer , 2005, ISPD '05.

[20]  Chris C. N. Chu,et al.  FastPlace: efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[22]  Gi-Joon Nam,et al.  ISPD 2006 Placement Contest: Benchmark Suite and Results , 2006, ISPD '06.

[23]  Yao-Wen Chang,et al.  Modern floorplanning based on fast simulated annealing , 2005, ISPD '05.

[24]  Joseph R. Shinnerl,et al.  Fast floorplanning by look-ahead enabled recursive bipartitioning , 2006, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[25]  Cheng-Kok Koh,et al.  Recursive bisection based mixed block placement , 2004, ISPD '04.

[26]  Joseph R. Shinnerl,et al.  An Enhanced Multilevel Algorithm for Circuit Placement , 2003, ICCAD 2003.

[27]  Igor L. Markov,et al.  Constraint-driven floorplan repair , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[28]  Igor L. Markov,et al.  Are floorplan representations important in digital design? , 2005, ISPD '05.

[29]  Andrew B. Kahng,et al.  Can recursive bisection alone produce routable, placements? , 2000, Proceedings 37th Design Automation Conference.

[30]  Taraneh Taghavi,et al.  Dragon2005: large-scale mixed-size placement tool , 2005, ISPD '05.

[31]  Yao-Wen Chang,et al.  Multilevel floorplanning/placement for large-scale modules using B*-trees , 2003, DAC '03.

[32]  Majid Sarrafzadeh,et al.  A standard-cell placement tool for designs with high row utilization , 2002, Proceedings. IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[33]  Yao-Wen Chang,et al.  IMF: interconnect-driven multilevel floorplanning for large-scale building-module designs , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[34]  Joseph R. Shinnerl,et al.  An area-optimality study of floorplanning , 2004, ISPD '04.

[35]  Chung-Kuan Cheng,et al.  Unified quadratic programming approach for mixed mode placement , 2005, ISPD '05.

[36]  Yao-Wen Chang,et al.  B*-Trees: a new representation for non-slicing floorplans , 2000, DAC.