基于深度学习的VLSI超图划分
VLSI Hypergraph Partitioning with Deep Learning
AI总结:
本文针对VLSI超图网表划分问题,提出一组具有已知切割质量上界的新型合成基准,并系统评估了现有最先进划分算法与基于GNN的方法,揭示其各自优劣。
摘要:
划分是计算机科学中的一个已知问题,在芯片设计工作流程中至关重要,因为该领域的进展可以显著影响设计质量和效率。深度学习(DL)技术,特别是涉及图神经网络(GNN)的技术,在使用归纳式和直推式学习方法的各种节点、边和图预测任务中表现出强大的性能。GNN中近期引起关注的一个显著领域是池化层及其在图划分中的应用。虽然这些方法在社交图、计算图和其他随机图上取得了有前景的结果,但它们在VLSI超图网表背景下的有效性尚未被探索。在本研究中,我们引入了一组新的合成划分基准,这些基准模拟了真实网表特征,并具有已知的解决方案切割质量上界。我们将这些基准与先前工作区分开来,并评估了现有的最先进划分算法以及基于GNN的方法,突出了它们各自的优缺点。
英文摘要:
Partitioning is a known problem in computer science and is critical in chip design workflows, as advancements in this area can significantly influence design quality and efficiency. Deep Learning (DL) techniques, particularly those involving Graph Neural Networks (GNNs), have demonstrated strong performance in various node, edge, and graph prediction tasks using both inductive and transductive learning methods. A notable area of recent interest within GNNs are pooling layers and their application to graph partitioning. While these methods have yielded promising results across social, computational, and other random graphs, their effectiveness has not yet been explored in the context of VLSI hypergraph netlists. In this study, we introduce a new set of synthetic partitioning benchmarks that emulate real-world netlist characteristics and possess a known upper bound for solution cut quality. We distinguish these benchmarks with the prior work and evaluate existing state-of-the-art partitioning algorithms alongside GNN-based approaches, highlighting their respective advantages and disadvantages.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。