12 March 2024 in IEEE Transactions on Circuits and Systems II: Express Briefs
Macro placement is a crucial and complex task in chip design. In recent years, reinforcement learning (RL) has emerged as a promising approach for autonomously generating effective macro placement on a grid-based chip canvas. However, existing RL-based macro placers encounter challenges when handling macros of varying sizes and preplaced blocks, due to using coarse-grained grids leads to wastage of placement space, while employing fine-grained grids results in an exponentially growing solution space and significant computational overhead. This brief proposes a legalization-aided RL-based macro placement (LAMPlace) for mixed-size designs with preplaced blocks. LAMPlace leverages RL to generate a global macro placement that allows possible overlap, followed by a macro legalization algorithm to ensure the legality of macro placement. LAMPlace can effectively address macros of various sizes and preplaced blocks because the action mask generation algorithm in RL is well coupled with the macro legalization algorithm. Compared with the state-of-the-art works, experimental results on publicly mixed-size placement benchmarks show that LAMPlace is effective.
21 April 2025 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Field-programmable gate array (FPGA) macro placement holds a crucial role within the FPGA physical design flow since it substantially influences the subsequent stages of cell placement and routing. With the increasing number of macros and the complex cascade shape and region constraints imposed by modern FPGAs, the routability and macro placement have become much more challenging. In this article, we propose an effective and efficient routability-driven macro placement algorithm for modern FPGAs with cascade shape and region constraints. To reserve adequate space for cell placement and guarantee routability, we first develop a routability-driven mixed-size analytical global placement that evenly distributes both macros and cells while considering cascade shape and region constraints. Particularly, the proposed global placement engine integrates a well-trained congestion prediction model, targeting benchmarks with high routing congestion to enhance overall routability. Then, we propose an integer linear programming (ILP)-based cascade shape legalization followed by matching-based macro legalization to remove macro overlaps while satisfying the region constraints. Finally, a routability-driven detailed macro placement is proposed to refine the solution. Compared with the winners of the MLCAD 2023 FPGA macro placement contest and state-of-the-art works, experimental results show that our algorithm achieves the best overall score and routability.