Reinforcement Learning Framework for Efficient Placement and Routing in VLSI


Date Published : 25 September 2026

Contributors

P MANIRAJ KUMAR

Lincoln University Malaysia
Author

Dr.P.Nagarajan

J N N College of Engineering
Author

Keywords

VLSI Physical Design; Artificial Intelligence; Machine Learning; Setup and Hold Violations; Clock Skew; Routing Congestion; Clock Tree Synthesis; Graph Neural Networks; Reinforcement Learning; Design Closure; Static Timing Analysis.

Proceeding

Track

General Track

License

Copyright (c) 2026 Sustainable Global Societies Initiative

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Abstract

As integrated circuit design scales into deep sub-micron and multi-billion-transistor regimes, the physical design (PD) stage of the VLSI design flow has become the dominant bottleneck in achieving timely design closure [1]. Conventional physical design methodologies rely on iterative, rule-based Electronic Design Automation (EDA) flows in which placement, clock tree synthesis (CTS), and routing are repeatedly refined in response to setup and hold timing violations, clock skew, and routing congestion. This reactive, trial-and-error approach typically requires ten to fifty design iterations, resulting in long turnaround times, high engineering effort, and unpredictable convergence [1]. This paper presents a comprehensive study of Artificial Intelligence (AI) and Machine Learning (ML) driven automation techniques for physical design optimization, with specific emphasis on four recurring bottlenecks: setup and hold timing violations, routing congestion, clock skew and uncertainty, and the high iteration count that inflates the overall design cycle. We describe how supervised learning, Graph Neural Networks (GNNs) [2], [6], and Reinforcement Learning (RL) [2], [4] can be embedded at successive stages of the flow — from early netlist analysis through placement, CTS, and routing — to convert the flow from reactive violation-fixing to proactive, prediction-guided optimization. A methodology combining historical design data, netlist-graph feature extraction, and model training integrated with commercial EDA tools (Cadence Innovus [7] / Synopsys IC Compiler II [8]) is proposed and evaluated conceptually against traditional flows on 45 nm and 28 nm benchmark circuits drawn from the ISCAS [9] and OpenCores [10] suites. Comparative analysis indicates that AI-guided flows can reduce the number of design iterations from twelve to fifteen down to four to six, and can shorten the duration of individual physical design stages — including placement, CTS, routing, timing closure, and design rule checking — by 40–67%. These results suggest that AI-driven automation offers a practical and scalable path toward faster, more predictable, and less labor-intensive VLSI physical design closure.

References

No References

Downloads

How to Cite

Kumar, P., & Pandiyan, N. (2026). Reinforcement Learning Framework for Efficient Placement and Routing in VLSI. Sustainable Global Societies Initiative, 1(11). https://vectmag.com/sgsi/paper/view/1191