去而复返:一个网表的传奇与大量电子图重写
There and Back Again: A Netlist's Tale with Much Egraphin'
AI总结:
本文提出用等式饱和项重写框架统一处理EDA编译与反编译任务,并通过案例研究验证其特性与EDA需求高度契合。
摘要:
EDA工具链以其不可预测、不完整和易出错而闻名;普遍接受的补救措施是将EDA任务重新构想为编译问题。然而,我们应用的任何编译器框架都必须准备好处理广泛的EDA任务,不仅包括技术映射和优化等编译任务(我们标题中的“去”),还包括循环重卷等反编译任务(“复返”)。在本文中,我们主张将等式饱和——一种项重写框架——作为构建硬件工具链时的首选框架。通过一系列案例研究,我们展示了EDA任务的需求与等式饱和所提供的特性如何显著地契合。
英文摘要:
EDA toolchains are notoriously unpredictable, incomplete, and error-prone; the generally-accepted remedy has been to re-imagine EDA tasks as compilation problems. However, any compiler framework we apply must be prepared to handle the wide range of EDA tasks, including not only compilation tasks like technology mapping and optimization (the "there"} in our title), but also decompilation tasks like loop rerolling (the "back again"). In this paper, we advocate for equality saturation -- a term rewriting framework -- as the framework of choice when building hardware toolchains. Through a series of case studies, we show how the needs of EDA tasks line up conspicuously well with the features equality saturation provides.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。