Graph Neural Network based Initialization for Timing Driven Placement
Open Access
- 10 April 2026
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 31 (5) , 1-23
Abstract
Timing-driven placement is very important to achieve timing closure especially as designs become increasingly complex. This article presents a novel Timing-Driven Placement (TDP) framework that integrates a graph convolutional network (GCN), Dirichlet boundary conditions, and a nonlinear placement engine to optimize placement quality with timing awareness throughout the flow. The proposed methodology begins by clustering components based on their interconnection topology, while Dirichlet boundary conditions are applied to handle fixed components such as IOs and macros. This yields a reduced graph with minimized inter-cluster connectivity, simplifying timing optimization. A GCN is then trained to learn a generalized and optimized mapping from circuit connectivity to physical wirelength. To improve early-stage timing estimation, virtual buffers are inserted prior to Static Timing Analysis (STA) to eliminate maximum capacitance violations. With this improved timing fidelity, STA provides pin-level slack, which is then used to dynamically adjust interconnection weights, guiding the placement of timing-critical components toward improved timing closure. Experimental results on ICCAD2015 contest benchmarks demonstrate that our algorithm can improve worse negative slack and total negative slack by 6% compared to the state-of-the-art method.Keywords
This publication has 47 references indexed in Scilit:
- Reducing delay and resistance of GNR based interconnect using insertion of buffersAnalog Integrated Circuits and Signal Processing, 2025
- AiTO: Simultaneous gate sizing and buffer insertion for timing optimization with GNNs and RLIntegration, 2024
- RePlAce: Advancing Solution Quality and Routability Validation in Global PlacementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018
- OpenTimer: A high-performance timing analysis tool2015
- ICCAD-2015 CAD contest in incremental timing-driven placement and benchmark suite2015
- ePlace-MS: Electrostatics-Based Placement for Mixed-Size CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2015
- NTUplace4h: A Novel Routability-Driven Placement Algorithm for Hierarchical Mixed-Size Circuit DesignsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2014
- FFTPL: An analytic placement algorithm using fast fourier transform for density equalization2013
- FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI DesignIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2007
- Sensitivity guided net weighting for placement-driven synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2005