arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.06077cs.LGcs.AI
收藏

MTLSO:一种用于逻辑综合优化的多任务学习方法

MTLSO: A Multi-Task Learning Approach for Logic Synthesis Optimization

Faezeh Faez, Raika Karimi, Yingxue Zhang, Xing Li, Lei Chen, Mingxuan Yuan, Mahdi Biparva

AI总结:

针对逻辑综合优化中AIG数据匮乏、普通GNN表征能力不足的问题,提出多任务学习框架MTLSO,结合多任务训练与分层图表征学习,在延迟和面积指标上均取得优于现有方法的性能提升。

摘要:

电子设计自动化(EDA)是集成电路(IC)设计的核心环节,近年来借助人工智能技术有效提升了效率。逻辑综合作为EDA的关键阶段,负责将高层硬件描述转换为优化后的网表。现有研究已采用机器学习预测与非门图(AIG)和综合配方组合的结果质量(QoR)。但可用AIG数量极为有限导致的数据严重匮乏问题,会引发模型过拟合,大幅限制性能提升。此外,AIG结构复杂且节点数量庞大,使得普通图神经网络(GNN)难以学习到具有强表达能力的图级表征。\n为解决上述挑战,我们提出MTLSO——一种面向逻辑综合优化的多任务学习方法。一方面,该方法通过跨不同任务训练模型,最大化有限数据的利用率:在主回归任务之外引入二元多标签图分类辅助任务,让模型从多元监督信号中获益。另一方面,我们采用分层图表征学习策略,提升模型对大规模AIG的强表达力图级表征的学习能力,效果优于传统普通GNN。\n在多个数据集上与当前最优基线方法的大量对比实验证明了本方法的优越性,其在延迟指标上平均性能提升8.22%,在面积指标上平均性能提升5.95%。

英文摘要:

Electronic Design Automation (EDA) is essential for IC design and has recently benefited from AI-based techniques to improve efficiency. Logic synthesis, a key EDA stage, transforms high-level hardware descriptions into optimized netlists. Recent research has employed machine learning to predict Quality of Results (QoR) for pairs of And-Inverter Graphs (AIGs) and synthesis recipes. However, the severe scarcity of data due to a very limited number of available AIGs results in overfitting, significantly hindering performance. Additionally, the complexity and large number of nodes in AIGs make plain GNNs less effective for learning expressive graph-level representations. To tackle these challenges, we propose MTLSO - a Multi-Task Learning approach for Logic Synthesis Optimization. On one hand, it maximizes the use of limited data by training the model across different tasks. This includes introducing an auxiliary task of binary multi-label graph classification alongside the primary regression task, allowing the model to benefit from diverse supervision sources. On the other hand, we employ a hierarchical graph representation learning strategy to improve the model's capacity for learning expressive graph-level representations of large AIGs, surpassing traditional plain GNNs. Extensive experiments across multiple datasets and against state-of-the-art baselines demonstrate the superiority of our method, achieving an average performance gain of 8.22\% for delay and 5.95\% for area.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑