Critical Path Aware Timing-Driven Global Placement for Large-Scale Heterogeneous FPGAs
By: He Jiang , Yi Guo , Shikai Guo and more
Potential Business Impact:
Makes computer chips run faster and more reliably.
Timing optimization during global placement is critical for achieving optimal circuit performance and remains a key challenge in modern Field Programmable Gate Array (FPGA) design. As FPGA designs scale and heterogeneous resources increase, dense interconnects introduce significant resistive and capacitive effects, making timing closure increasingly difficult. Existing methods face challenges in constructing accurate timing models due to multi-factor nonlinear constraints as well as load and crosstalk coupling effects arising in multi-pin driving scenarios. To address these challenges, we propose TD-Placer, a critical path aware, timing-driven global placement framework. It leverages graph-based representations to capture global net interactions and employs a nonlinear model to integrate diverse timing-related features for precise delay prediction, thereby improving the overall placement quality for FPGAs. TD-Placer adopts a quadratic placement objective that minimizes wirelength while incorporating a timing term constructed by a lightweight algorithm, enabling efficient and high-quality timing optimization. Regarding net-level timing contention, it also employs a finer-grained weighting scheme to facilitate smooth reduction of the Critical Path Delay (CPD). Extensive experiments were carried out on seven real-world open-source FPGA projects with LUT counts ranging from 60K to 400K. The results demonstrate that TD-Placer achieves an average 10% improvement in Worst Negative Slack (WNS) and a 5% reduction in CPD compared to the state-of-the-art method, with an average CPD comparable (*1.01) to the commercial AMD Vivado across five versions (2020.2-2024.2). Its code and dataset are publicly available.
Similar Papers
Timing-Driven Global Placement by Efficient Critical Path Extraction
Hardware Architecture
Makes computer chips faster by arranging parts better.
Practical Timing Closure in FPGA and ASIC Designs: Methods, Challenges, and Case Studies
Hardware Architecture
Makes computer chips run much faster.
TimelyHLS: LLM-Based Timing-Aware and Architecture-Specific FPGA HLS Optimization
Cryptography and Security
Makes computer chips faster and smaller automatically.