Detailed Routing Short Violation Prediction Using Graph-Based Deep Learning Model
Xuan Chen, Zhixiong Di, Wei Wu, Qiang Wu, Jiangyi Shi, Quanyuan Feng
Abstract
As the manufacturing process continuously shrinks, how to accurately estimate routability at placement is becoming increasingly important. In addition to extracting local features, this article innovatively constructs an adjacency matrix to represent the connection relationship among tiles, which can reflect the placement quality more comprehensively. To effectively map local features of tiles to the corresponding adjacency matrix, a graph neural network is employed. This trained model is used to predict short violations at the placement stage. Experimental results demonstrate the proposed method can achieve better binary classification quality for designs with severe shorts and outperforms in inductive learning than available machine learning frameworks.