GAT-Steiner:使用图神经网络进行直线斯坦纳最小树预测
GAT-Steiner: Rectilinear Steiner Minimal Tree Prediction Using GNNs
AI总结:
本文提出GAT-Steiner图注意力网络模型,利用GNN高精度预测RSMT最优斯坦纳点,在ISPD19和随机基准上预测准确率分别达99.846%和99.942%,且线长增加极小。
摘要:
直线斯坦纳最小树(RSMT)问题是VLSI布局与布线中的一个基本问题,且已知为NP难问题。传统RSMT算法花费大量时间寻找斯坦纳点以降低总线长,或使用启发式方法进行近似,从而产生次优结果。我们表明,图神经网络(GNNs)可用于高精度预测RSMT中的最优斯坦纳点,并可在GPU上并行化。在本文中,我们提出GAT-Steiner,一种图注意力网络模型,在ISPD19基准测试中正确预测了99.846%的线网,且在次优线长线网上平均线长仅增加0.480%。在随机生成的基准测试上,GAT-Steiner正确预测了99.942%的线网,且在次优线长线网上平均线长仅增加0.420%。
英文摘要:
The Rectilinear Steiner Minimum Tree (RSMT) problem is a fundamental problem in VLSI placement and routing and is known to be NP-hard. Traditional RSMT algorithms spend a significant amount of time on finding Steiner points to reduce the total wire length or use heuristics to approximate producing sub-optimal results. We show that Graph Neural Networks (GNNs) can be used to predict optimal Steiner points in RSMTs with high accuracy and can be parallelized on GPUs. In this paper, we propose GAT-Steiner, a graph attention network model that correctly predicts 99.846% of the nets in the ISPD19 benchmark with an average increase in wire length of only 0.480% on suboptimal wire length nets. On randomly generated benchmarks, GAT-Steiner correctly predicts 99.942% with an average increase in wire length of only 0.420% on suboptimal wire length nets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。