EDA-ML: Graph Representation Learning Framework for Digital IC Design Automation

Pratik Shrestha and Ioannis Savidis
Drexel University


The increase in design complexity of very large-scale integrated (VLSI) circuits due to CMOS technology scaling has generated a growing interest in the integration of machine learning (ML) algorithms into traditional electronic design automation (EDA) methodologies. Graph representation learning (GRL) techniques have gained significant attention in recent years owing to the ability to capture complex relationships in graph-structured data. This paper introduces a task-agnostic graph representation learning framework for integrated circuit (IC) design automation, which effectively addresses the challenges presented by diverse data representations and metrics generated during the standard design flow. The framework converts circuit designs and performance metrics extracted from the EDA tools at the different design stages into standardized graph representations, capturing structural relationships among design elements and encoding essential characteristics through graph convolutions for meaningful vectorized embeddings. The vectorized embeddings are incorporated into a machine-learning flow to predict downstream metrics evaluation by EDA design tools. The effectiveness of the framework is demonstrated by implementing and analyzing two distinct prediction tasks; specifically post-floorplan to post-routing arrival time prediction and post-placement to post-routing interconnect parasitic impedance prediction. The evaluation is performed on a dataset generated from the IWLS'05 benchmark circuits. The analysis of results indicates an improvement in mean absolute error of 28.71% and an improvement of mean absolute percentage error of 39.2% for arrival time prediction and an improvement of mean absolute error of 22.88% and an improvement in mean absolute percentage error of 19.64% for parasitic impedance prediction.