Rotation Mutation-Driven Evolutionary Algorithm for Efficient Macro Placement
Macro placement is a crucial sub-stage of chip design that focuses on determining the locations of numerous macros while optimizing multiple metrics. In recent years, evolutionary algorithms (EAs) have emerged as a promising technique for enhancing placement performance. However, the solution space of the previous methods is often limited by two-dimensional grids due to insufficient consideration of macro orientation during placement, leading to missed opportunities for further improvement. To address this issue, we propose EA-Rotation for macro placement, which incorporates rotation into the mutation operator to perturb the placement by adjusting the orientation of macros. Utilizing this efficient operator in conjunction with a greedy algorithm, EA-Rotation achieves superior placement solutions. Additionally, EA-Rotation serves as a fine-tuning technique for optimizing both the locations and orientation of macros, significantly improving the placement solutions of existing methods. Comprehensive experiments demonstrate that EA-Rotation outperforms state-of-the-art methods and is effectively integrated with other mutation operators.
Authors
- Han Sun (ORCID: https://orcid.org/0000-0002-2208-6672)
- Ningzhong Liu (ORCID: https://orcid.org/0000-0002-6735-7130)
- Tianyi Liu (ORCID: https://orcid.org/0009-0008-5370-3582)
- Shanding Xu (ORCID: https://orcid.org/0000-0002-7242-1352)
- Yaxin Xu (ORCID: https://orcid.org/0009-0001-0071-2679)
Institutions
- Nanjing Institute of Technology (CN)
- Nanjing University of Aeronautics and Astronautics (CN)
Publication Details
- Journal
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 2025-06-16
- DOI
- https://doi.org/10.1109/tcad.2025.3580346
- Primary Topic
- Modular Robots and Swarm Intelligence
- Type
- article
- Field-Weighted Citation Impact
- 0.00