The Power of Graph Signal Processing for Chip Placement Acceleration
Placement is a critical task with high computation complexity in VLSI physical design. Modern analytical placers formulate the placement objective as a nonlinear optimization task, which suffers a long iteration time. To accelerate and enhance the placement process, recent studies have turned to deep learning-based approaches, particularly leveraging graph convolution networks (GCNs). However, learning-based placers require time- and data-consuming model training due to the complexity of circuit placement that involves large-scale cells and design-specific graph statistics.
Authors
- Li Shang (ORCID: https://orcid.org/0000-0003-3944-7531)
- Fan Yang (ORCID: https://orcid.org/0000-0003-2164-8175)
- Xuan Zeng (ORCID: https://orcid.org/0000-0002-8097-4053)
- Jia Wang (ORCID: https://orcid.org/0000-0002-6159-6085)
- Yiting Liu (ORCID: https://orcid.org/0000-0001-8078-6717)
- Hai Zhou (ORCID: https://orcid.org/0000-0003-4824-7179)
Institutions
- Northwestern University (US)
- Fudan University (CN)
Publication Details
- Published
- 2024-10-27
- DOI
- https://doi.org/10.1145/3676536.3676669
- Citations
- 1
- Primary Topic
- VLSI and FPGA Design Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.21
Funders
- National Natural Science Foundation of China
- National Key Research and Development Program of China