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

使用E-Graph自动化约束感知数据路径优化

Automating Constraint-Aware Datapath Optimization using E-Graphs

Samuel Coward, George A. Constantinides, Theo Drane

摘要:

数值硬件设计需要积极的优化,其中设计人员利用分支约束,创建仅在输入空间的子域上有效的优化机会。我们开发了一个RTL优化工具,可以自动学习条件分支的结果,并利用这些知识进行深度优化。该工具基于抽象解释理论部署定制的程序分析,当与称为电子图的数据结构相结合时,简化了关于程序属性的复杂推理。我们的工具可以全自动地从计算机算术文献中发现已知的浮点架构,并优于基线EDA工具,生成速度快33%,电路尺寸小41%。

英文摘要:

Numerical hardware design requires aggressive optimization, where designers exploit branch constraints, creating optimization opportunities that are valid only on a sub-domain of input space. We developed an RTL optimization tool that automatically learns the consequences of conditional branches and exploits that knowledge to enable deep optimization. The tool deploys custom built program analysis based on abstract interpretation theory, which when combined with a data-structure known as an e-graph simplifies complex reasoning about program properties. Our tool fully-automatically discovers known floating-point architectures from the computer arithmetic literature and out-performs baseline EDA tools, generating up to 33% faster and 41% smaller circuits.

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

↑