The Policy-gradient Placement and Generative Routing Neural Networks for Chip Design
Ruoyu Cheng, Xianglong Lyu, Yang Li, Junjie Ye, Jianye Hao, Junchi Yan
Abstract
Placement and routing are two critical yet time-consuming steps of chip design in modern VLSI systems. Distinct from traditional heuristic solvers, this paper on one hand proposes an RL-based model for mixed-size macro placement, which differs from existing learning-based placers that often consider the macro by coarse grid-based mask. While the standard cells are placed via gradient-based GPU acceleration. On the other hand, a one-shot conditional generative routing model, which is composed of a special-designed input-size-adapting generator and a bi-discriminator, is devised to perform one-shot routing to the pins within each net, and the order of nets to route is adaptively learned. Combining these techniques, we develop a flexible neural pipeline, which to our best knowledge, is the first joint placement and routing network without involving any traditional heuristic solver. Experimental results on chip design benchmarks showcase the effectiveness of our approach. Source code will be made publicly available at: https://github.com/Thinklab-SJTU/EDA-AI
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 352b4bad-c96d-4e1b-a273-8470ceb0a6a0Cited by top-tier papers25
- From Distribution Learning in Training to Gradient Search in Testing for Combinatorial OptimizationYang Li, Jinpei Guo, Runzhong Wang, Junchi YanNeurIPS 2023 · 115 citations
- ChiPFormer: Transferable Chip Placement via Offline Decision TransformerYao Lai, Jinxin Liu, Zhentao Tang, Bin Wang et al.ICML 2023 · 69 citations
- Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial OptimizationYang Li, Jinpei Guo, Runzhong Wang, Hongyuan Zha et al.NeurIPS 2024 · 65 citations
- Macro Placement by Wire-Mask-Guided Black-Box OptimizationYunqi Shi, Ke Xue, Song Lei, Chao QianNeurIPS 2023 · 48 citations
- Reinforcement Learning within Tree Search for Fast Macro PlacementZijie Geng, Jie Wang, Ziyan Liu, Siyuan Xu et al.ICML 2024 · 23 citations
Builds on3
- On Joint Learning for Solving Placement and Routing in Chip DesignRuoyu Cheng, Junchi YanNeurIPS 2021 · 135 citations
- Learning a Latent Search Space for Routing Problems using Variational AutoencodersAndré Hottung, Bhanu Bhandari, Kevin TierneyICLR 2021 · 67 citations
- REST: Constructing Rectilinear Steiner Minimum Tree via Reinforcement LearningJinwei Liu, Gengjie Chen, Evangeline F. Y. YoungDAC 2021 · 29 citations
Related papers
- Chip Placement with Diffusion ModelsVint Lee, Minh Nguyen, Leena Elzeiny, Chun Deng et al.ICML 2025
- MaskPlace: Fast Chip Placement via Reinforced Visual Representation LearningYao Lai, Yao Mu, Ping LuoNeurIPS 2022 · 105 citations
- RoutePlacer: An End-to-End Routability-Aware Placer with Graph Neural NetworkYunbo Hou, Haoran Ye, Yingxue Zhang, Siyuan Xu et al.KDD 2024 · 3 citations
- HubRouter: Learning Global Routing via Hub Generation and Pin-hub ConnectionXingbo Du, Chonghua Wang, Ruizhe Zhong, Junchi YanNeurIPS 2023 · 17 citations
- Reinforcement Learning Policy as Macro Regulator Rather than Macro PlacerKe Xue, Ruo-Tong Chen, Xi Lin, Yunqi Shi et al.NeurIPS 2024 · 19 citations
