Yiting Liu
ABSTRACT
Floorplanning has long been a critical physical design task with high computation complexity. Its key objective is to determine the initial locations of macros and standard cells with optimized wirelength for a given area constraint. This paper presents Flora, a graph attention-based floorplanner to learn an optimized mapping between circuit connectivity and physical wirelength, and produce a chip floorplan using efficient model inference. Flora has been integrated with two state-of-the-art mixed-size placers. Experimental studies using both academic benchmarks and industrial designs demonstrate that compared to state-of-the-art mixed-size placers alone, Flora improves placement runtime by 18%, with 2% wirelength reduction on average.
- Igor L.Markov Andrew Kahng, Jens Leinig and Jin Hu. 2011. VLSI Physical Design: From Graph Partitioning to Timing Closure. (2011).Google Scholar
- Andrew E. Caldwell, Andrew B. Kahng, and Igor L. Markov. 2000. Toward CAD-IP Reuse: The MARCO GSRC Bookshelf of Fundamental CAD Algorithms. IEEE Design & Test (2000), 72--81.Google Scholar
- Chin-Chih Chang, J. Cong, and Min Xie. 2003. Optimality and scalability study of existing placement algorithms. In Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003. 621--627.Google ScholarDigital Library
- C. Cheng, A. B. Kahng, I. Kang, and L. Wang. 2019. RePlAce: Advancing Solution Quality and Routability Validation in Global Placement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 38, 9 (2019), 1717--1730.Google ScholarDigital Library
- G. Golub and C.V. Loan. 1983. Matrix computations. In Baltimore: Johns Hopkins University Press.Google Scholar
- Ian Goodfellow, Yoshua Bengio, and Aaron Courville. 2016. Deep Learning. MIT Press. http://www.deeplearningbook.org.Google ScholarDigital Library
- Jiaqi Gu, Zixuan Jiang, Yibo Lin, and David Z. Pan. 2020. DREAMPlace 3.0: Multi-Electrostatics Based Robust VLSI Placement with Region Constraints. In 2020 IEEE/ACM International Conference On Computer Aided Design (ICCAD). 1--9.Google Scholar
- Andrew B. Kahng. 2000. Classical Floorplanning Harmful?. In Proceedings of the 2000 International Symposium on Physical Design (ISPD '00). Association for Computing Machinery, New York, NY, USA, 207--213.Google ScholarDigital Library
- K. Kiyota and K. Fujiyoshi. 2000. Simulated annealing search through general structure floorplans using sequence-pair. In 2000 IEEE International Symposium on Circuits and Systems (ISCAS), Vol. 3. 77--80.Google Scholar
- Jingwei Lu. 2010. Fundamental Research on Electronic Design Automation in VLSI Design - Routability.Google Scholar
- J. Lu, H. Zhuang, P. Chen, H. Chang, C. C. Chang, Y. C. Wong, L. Sha, D. Huang, Y. Luo, C. C. Teng, and C. K. Cheng. 2015. ePlace-MS: Electrostatics-Based Placement for Mixed-Size Circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 34, 5 (2015), 685--698.Google ScholarDigital Library
- Igor L. Markov, Jin Hu, and Myung-Chul Kim. 2015. Progress and Challenges in VLSI Placement Research. Proc. IEEE 103, 11 (2015), 1985--2003.Google ScholarCross Ref
- Azalia Mirhoseini, Anna Goldie, Mustafa Yazgan, Joe Wenjie Jiang, Ebrahim Songhori, Shen Wang, Young-Joon Lee, Eric Johnson, Omkar Pathak, Azade Nazi, et al. 2021. A graph placement methodology for fast chip design. Nature 594, 7862 (2021), 207--212.Google Scholar
- H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani. 1996. VLSI Module Placement Based on Rectangle-Packing by the Sequence-Pair. Trans. Comp.-Aided Des. Integ. Cir. Sys. 15, 12 (1996), 1518--1524.Google ScholarDigital Library
- Yangfeng Su, Fan Yang, and Xuan Zeng. 2012. AMOR: An Efficient Aggregating Based Model Order Reduction Method for Many-Terminal Interconnect Circuits. In Proceedings of the 49th Annual Design Automation Conference. 295--300.Google ScholarDigital Library
- Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2018. Graph attention networks. In ICLR.Google Scholar
Recommendations
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rates. Based on binary trees, the MP-tree is very efficient, effective, and ...
Fast floorplanning by look-ahead enabled recursive bipartitioning
A new paradigm is introduced for floorplanning any combination of fixed-shape and variable-shape blocks under tight fixed-outline area constraints and a wirelength objective. Dramatic improvement over traditional floorplanning methods is achieved by the ...
Modern floorplanning based on B*-tree and fast simulated annealing
Unlike classical floorplanning that usually handles only block packing to minimize silicon area, modern very large scale integration (VLSI) floorplanning typically needs to pack blocks within a fixed die (outline), and additionally considers the packing ...
Comments