Benchmarking End-To-End Performance of AI-Based Chip Placement Algorithms
Not on the map. Why?
Abstract (arXiv)
The increasing complexity of modern very-large-scale integration (VLSI) design highlights the significance of Electronic Design Automation (EDA) technologies. Chip placement is a critical step in the EDA workflow, which positions chip modules on the canvas with the goal of optimizing performance, power, and area (PPA) metrics of final chip designs. Recent advances have demonstrated the great potential of AI-based algorithms in enhancing chip placement. However, due to the lengthy workflow of chip design, the evaluations of these algorithms often focus on intermediate surrogate metrics, which are easy to compute but frequently reveal a substantial misalignment with the end-to-end performance (i.e., the final design PPA). To address this challenge, we introduce ChiPBench, which can effectively facilitate research in chip placement within the AI community. ChiPBench is a comprehensive benchmark specifically designed to evaluate the effectiveness of existing AI-based chip placement algorithms in improving final design PPA metrics. Specifically, we have gathered 20 circuits from various domains (e.g., CPU, GPU, and microcontrollers). These designs are compiled by executing the workflow from the verilog source code, which preserves necessary physical implementation kits, enabling evaluations for the placement algorithms on their impacts on the final design PPA. We executed six state-of-the-art AI-based chip placement algorithms on these designs and plugged the results of each single-point algorithm into the physical implementation workflow to obtain the final PPA results. Experimental results show that even if intermediate metric of a single-point algorithm is dominant, while the final PPA results are unsatisfactory. We believe that our benchmark will serve as an effective evaluation framework to bridge the gap between academia and industry.
Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 10 of its 58 references that are in the map. First posted on arXiv 3 Jul 2024.
Builds on
10 of 58 references.
References · 10
- 2021Machine Learning for Electronic Design Automation: A Surveycited by 72
- 2021On Joint Learning for Solving Placement and Routing in Chip Designcited by 44
- 2022MaskPlace: Fast Chip Placement via Reinforced Visual Representation Learningcited by 43
- 2023ChiPFormer: Transferable Chip Placement via Offline Decision Transformercited by 42
- 2021OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit Synthesiscited by 30
- 2023Macro Placement by Wire-Mask-Guided Black-Box Optimizationcited by 23
- 2020Placement in Integrated Circuits using Cyclic Reinforcement Learning and Simulated Annealingcited by 12
- 2023An Updated Assessment of Reinforcement Learning for Macro Placementcited by 11
- 2023Hier-RTLMP: A Hierarchical Automatic Macro Placer for Large-scale Complex IP Blockscited by 11
- 2023A Circuit Domain Generalization Framework for Efficient Logic Synthesis in Chip Designcited by 6
Built on by
Citing papers per year: 2024: 1; 2025: 7; 2026: 6.
14 papers.
Sort:
By area:
- 2024Uncertainty-based Offline Variational Bayesian Reinforcement Learning for Robustness under Diverse Data Corruptionscited by 8
- 2025BBOPlace-Bench: Benchmarking Black-Box Optimization for Chip Placementcited by 5
- 2025Timing-Driven Global Placement by Efficient Critical Path Extractioncited by 4
- 2025Open3DBench: Open-Source Benchmark for 3D-IC Backend Implementation and PPA Evaluationcited by 4
- 2026Short Chains, Deep Thoughts: Balancing Reasoning Efficiency and Intra-Segment Capability via Split-Merge Optimizationcited by 1
- 2026CapBench: A Multi-PDK Dataset for Machine-Learning-Based Post-Layout Capacitance Extractioncited by 1
- 2025Piano: A Multi-Constraint Pin Assignment-Aware Floorplannercited by 0
- 2025Learning-Guided Integration Contours Construction for Fast Large-Scale Generalized Eigensolverscited by 0
- 2025AiEDA: An Open-Source AI-Aided Design Library for Design-to-Vectorcited by 0
- 2025Re2MaP: Macro Placement by Recursively Prototyping and Packing Tree-based Relocatingcited by 0
- 2026CoEvoP&R: Co-Evolving Placement Objectives with Routing Feedback via Large Language Modelscited by 0
- 2026PPAPlace: Differentiable Cross-Stage Objectives for Chip Placement Optimizationcited by 0
- 2026RollPlace: Improving Macro Placement via Monte Carlo Rollout Search5 Oct 2026
- 2026Trinity: One Differentiable Physics for Training, Refining and Scoring Generative Floorplanners4 Oct 2026
- 2026PPAPlace: Differentiable Cross-Stage Objectives for Chip Placement Optimization13 Aug 2026
- 2026CoEvoP&R: Co-Evolving Placement Objectives with Routing Feedback via Large Language Models19 Jul 2026
- 2026CapBench: A Multi-PDK Dataset for Machine-Learning-Based Post-Layout Capacitance Extraction13 Apr 2026
- 2026Short Chains, Deep Thoughts: Balancing Reasoning Efficiency and Intra-Segment Capability via Split-Merge Optimization3 Feb 2026
- 2025Re2MaP: Macro Placement by Recursively Prototyping and Packing Tree-based Relocating11 Nov 2025
- 2025AiEDA: An Open-Source AI-Aided Design Library for Design-to-Vector8 Nov 2025
- 2025Learning-Guided Integration Contours Construction for Fast Large-Scale Generalized Eigensolvers2 Nov 2025
- 2025BBOPlace-Bench: Benchmarking Black-Box Optimization for Chip Placement27 Oct 2025
- 2025Piano: A Multi-Constraint Pin Assignment-Aware Floorplanner20 Jul 2025
- 2025Open3DBench: Open-Source Benchmark for 3D-IC Backend Implementation and PPA Evaluation17 Mar 2025
- 2025BBOPlace-Bench: Benchmarking Black-Box Optimization for Chip Placementcited by 5
- 2025Timing-Driven Global Placement by Efficient Critical Path Extractioncited by 4
- 2025Open3DBench: Open-Source Benchmark for 3D-IC Backend Implementation and PPA Evaluationcited by 4
- 2026CapBench: A Multi-PDK Dataset for Machine-Learning-Based Post-Layout Capacitance Extractioncited by 1
- 2025Piano: A Multi-Constraint Pin Assignment-Aware Floorplannercited by 0
- 2025Learning-Guided Integration Contours Construction for Fast Large-Scale Generalized Eigensolverscited by 0
- 2025AiEDA: An Open-Source AI-Aided Design Library for Design-to-Vectorcited by 0
- 2025Re2MaP: Macro Placement by Recursively Prototyping and Packing Tree-based Relocatingcited by 0
- 2026CoEvoP&R: Co-Evolving Placement Objectives with Routing Feedback via Large Language Modelscited by 0
- 2026PPAPlace: Differentiable Cross-Stage Objectives for Chip Placement Optimizationcited by 0
- 2026Trinity: One Differentiable Physics for Training, Refining and Scoring Generative Floorplannerscited by 0
- 2026Trinity: One Differentiable Physics for Training, Refining and Scoring Generative Floorplanners4 Oct 2026
- 2026PPAPlace: Differentiable Cross-Stage Objectives for Chip Placement Optimization13 Aug 2026
- 2026CoEvoP&R: Co-Evolving Placement Objectives with Routing Feedback via Large Language Models19 Jul 2026
- 2026CapBench: A Multi-PDK Dataset for Machine-Learning-Based Post-Layout Capacitance Extraction13 Apr 2026
- 2025Re2MaP: Macro Placement by Recursively Prototyping and Packing Tree-based Relocating11 Nov 2025
- 2025AiEDA: An Open-Source AI-Aided Design Library for Design-to-Vector8 Nov 2025
- 2025Learning-Guided Integration Contours Construction for Fast Large-Scale Generalized Eigensolvers2 Nov 2025
- 2025BBOPlace-Bench: Benchmarking Black-Box Optimization for Chip Placement27 Oct 2025
- 2025Piano: A Multi-Constraint Pin Assignment-Aware Floorplanner20 Jul 2025
- 2025Open3DBench: Open-Source Benchmark for 3D-IC Backend Implementation and PPA Evaluation17 Mar 2025
- 2025Timing-Driven Global Placement by Efficient Critical Path Extraction28 Feb 2025