Pre-Routing Slack Prediction Based on Graph Attention Network

Static Timing Analysis (STA) plays a crucial role in realizing timing convergence of integrated circuits. In recent years, there has been growing research on pre-routing timing prediction using Graph Neural Networks (GNNs). However, existing approaches struggle with scalability on large graphs and lack generalizability to new designs, limiting their applicability to large-scale, complex circuit problems. To address this issue, this paper proposes a timing engine based on Graph Attention Network (GAT) to predict the slack of timing endpoints. Firstly, our model computes net embeddings for each node prior to training using a gated self-attention module. Subsequently, inspired by the Nonlinear Delay Model (NLDM), the node embeddings are propagated through multiple levels by alternately applying net propagation layers and cell propagation layers. Evaluated on 21 real circuits, the framework achieved a 16.62% improvement in average R2 score for slack prediction and a 15.55% reduction in runtime compared to the state-of-the-art (SOTA) method.

Authors

Institutions

Publication Details

Journal
Automation
Published
2025-05-06
DOI
https://doi.org/10.3390/automation6020020
Citations
1
Primary Topic
Network Packet Processing and Optimization
Type
article
Field-Weighted Citation Impact
2.27
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Pre-Routing Slack Prediction Based on Graph Attention Network

Xiaoyan Yang, Yue Wu, Jinke Li, Jiahui Hu
1 citations
Automation
Network Packet Processing and Optimization
2.27
article

Pre-Routing Slack Prediction Based on Graph Attention Network

Xiaoyan Yang, Yue Wu, Jinke Li, Jiahui Hu
article en
1 citations

Abstract

Static Timing Analysis (STA) plays a crucial role in realizing timing convergence of integrated circuits. In recent years, there has been growing research on pre-routing timing prediction using Graph Neural Networks (GNNs). However, existing approaches struggle with scalability on large graphs and lack generalizability to new designs, limiting their applicability to large-scale, complex circuit problems. To address this issue, this paper proposes a timing engine based on Graph Attention Network (GAT) to predict the slack of timing endpoints. Firstly, our model computes net embeddings for each node prior to training using a gated self-attention module. Subsequently, inspired by the Nonlinear Delay Model (NLDM), the node embeddings are propagated through multiple levels by alternately applying net propagation layers and cell propagation layers. Evaluated on 21 real circuits, the framework achieved a 16.62% improvement in average R2 score for slack prediction and a 15.55% reduction in runtime compared to the state-of-the-art (SOTA) method.

AutomationVol. 6(2)
Hangzhou Dianzi University (CN)
Openalex Percentile: Top 16%
Network Packet Processing and Optimization
2.27
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Pre-Routing Slack Prediction Based on Graph Attention Network — Xiaoyan Yang, Yue Wu, et al. · Automation (2025) | TGRS Research Map | TGRS