One Step Beyond: Feedthrough & Placement-Aware Rectilinear Floorplanner
Floorplanning determines the shapes and locations of modules on a chip canvas and plays a critical role in optimizing the chip's Power, Performance, and Area (PPA) metrics. However, existing floorplanning approaches often fail to integrate with subsequent physical design stages, leading to suboptimal in-module component placement and excessive inter-module feedthrough. To tackle this challenge, we propose Flora, a three-stage feedthrough and placement aware rectilinear floorplanner. In the first stage, Flora employs wiremask and position mask techniques to achieve coarse-grained optimization of HPWL and feedthrough. In the second stage, under the constraint of a fixed outline, Flora achieves a zero-whitespace layout by locally resizing module shapes, thereby performing fine-grained optimization of feedthrough and improving component placement. In the third stage, Flora utilizes a fast tree search-based method to efficiently place components-including macros and standard cells-within each module, subsequently adjusting module boundaries based on the placement results to enable cross-stage optimization. Experimental results show that Flora outperforms recent state-of-the-art floorplanning approaches, achieving an average reduction of 6% in HPWL, 5.16% in FTpin, 29.15% in FTmod, and a 14% improvement in component placement performance.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Piano: A Multi-Constraint Pin Assignment-Aware Floorplanner
Floorplanning is a critical step in VLSI physical design, increasingly complicated by modern constraints such as fixed-outline requirements, whitespace removal, and the presence of pre-placed modules. In addition, the as…
Toward Reinforcement Learning-based Rectilinear Macro Placement Under Human Constraints
Macro placement is a critical phase in chip design, which becomes more intricate when involving general rectilinear macros and layout areas. Furthermore, macro placement that incorporates human-like constraints, such as …
reinforcement-learningReinforcement LearningGAT-Steiner: Rectilinear Steiner Minimal Tree Prediction Using GNNs
The Rectilinear Steiner Minimum Tree (RSMT) problem is a fundamental problem in VLSI placement and routing and is known to be NP-hard. Traditional RSMT algorithms spend a significant amount of time on finding Steiner poi…
Graph AttentionRobust Safety-Critical Control for Dynamic Robotics
We present a novel method of optimal robust control through quadratic programs that offers tracking stability while subject to input and state-based constraints as well as safety-critical constraints for nonlinear dynami…
Simultaneous Input and State Interval Observers for Nonlinear Systems with Full-Rank Direct Feedthrough
A simultaneous input and state interval observer is presented for Lipschitz continuous nonlinear systems with unknown inputs and bounded noise signals for the case when the direct feedthrough matrix has full column rank.…