TY - GEN
T1 - Using Graph Neural Networks for Timing Estimations of RTL Intermediate Representations
AU - Sánchez Lopera, Daniela
AU - Subedi, Ishwor
AU - Ecker, Wolfgang
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Accurate timing information of a digital design is available only after routing. Timing violations require corrective changes, even at the register-transfer level (RTL). Thus, timing feedback at RTL could guide micro-architecture search and reduce design iterations. However, this feedback is time-consuming, requiring synthesis and timing analysis runs. Related works have recognized timing estimations' value in the digital design flow. Most approaches use the pre-routing gate-level netlist as input, losing the RTL mapping. Others estimate either individual component delays or only global timing metrics from RTL designs. This paper uses graph neural networks (GNNs) to estimate a design's maximum arrival time (AT) by leveraging component delay and slew prediction. Our approach takes as input an RTL intermediate graph representation provided by an RTL generation tool and timing metrics collected from open-source synthesis tools. Experimental results show that the best architecture achieves a coefficient of determination R2 of 0.82 and a maximum error of 3.79 ns for the AT prediction. The GNNs inference runtimes are three orders of magnitude faster than running RTL generation, synthesis, and timing analysis tools. Fast yet accurate estimations of ATs of an RTL could guide micro-architecture search at the early stages of the design.
AB - Accurate timing information of a digital design is available only after routing. Timing violations require corrective changes, even at the register-transfer level (RTL). Thus, timing feedback at RTL could guide micro-architecture search and reduce design iterations. However, this feedback is time-consuming, requiring synthesis and timing analysis runs. Related works have recognized timing estimations' value in the digital design flow. Most approaches use the pre-routing gate-level netlist as input, losing the RTL mapping. Others estimate either individual component delays or only global timing metrics from RTL designs. This paper uses graph neural networks (GNNs) to estimate a design's maximum arrival time (AT) by leveraging component delay and slew prediction. Our approach takes as input an RTL intermediate graph representation provided by an RTL generation tool and timing metrics collected from open-source synthesis tools. Experimental results show that the best architecture achieves a coefficient of determination R2 of 0.82 and a maximum error of 3.79 ns for the AT prediction. The GNNs inference runtimes are three orders of magnitude faster than running RTL generation, synthesis, and timing analysis tools. Fast yet accurate estimations of ATs of an RTL could guide micro-architecture search at the early stages of the design.
KW - Register-transfer level
KW - arrival time
KW - graph neural networks
KW - static timing analysis
KW - synthesis
UR - http://www.scopus.com/inward/record.url?scp=85178628289&partnerID=8YFLogxK
U2 - 10.1109/MLCAD58807.2023.10299859
DO - 10.1109/MLCAD58807.2023.10299859
M3 - Conference contribution
AN - SCOPUS:85178628289
T3 - 2023 ACM/IEEE 5th Workshop on Machine Learning for CAD, MLCAD 2023
BT - 2023 ACM/IEEE 5th Workshop on Machine Learning for CAD, MLCAD 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th ACM/IEEE Workshop on Machine Learning for CAD, MLCAD 2023
Y2 - 10 September 2023 through 13 September 2023
ER -