有限动态层级维护用于高效的逻辑优化
Bounded Dynamic Level Maintenance for Efficient Logic Optimization
AI总结:
本文提出了一种有界算法,用于高效维护逻辑优化中的动态层级,通过偏序拓扑分析,实现了更高效的节点层级更新。
摘要:
逻辑优化是电子设计自动化(EDA)流程中的关键阶段,对于实现所需的电路功率、性能和面积(PPA)目标至关重要。这些逻辑电路通常表示为有向无环图(DAGs),其中结构深度,通过节点层级量化,与定时性能密切相关。现代优化策略经常采用迭代、局部转换启发式方法(例如重写、重构)直接在该DAG结构上进行。随着优化不断修改图的局部结构,节点层级需要频繁动态更新以指导后续决策。然而,存在显著的差距:现有的增量更新节点层级的算法对小变化是无界的。这导致在给定的局部子图{ΔG_i}更新上,DAG G(V,E)的最坏复杂度为O(|V|²)。这种无界性质对效率造成严重瓶颈,阻碍了优化流程的可扩展性,尤其是在应用于当今普遍存在的大规模电路设计时。在本文中,我们分析了迭代逻辑优化中普遍存在的动态层级维护问题,通过偏序拓扑的视角进行阐述。基于分析,我们提出了第一个有界的维护层级约束的算法,该算法在一系列|V|次更新{ΔG_i}中,时间复杂度为O(|V| Δ log Δ),其中Δ= max_i ||ΔG_i||表示ΔG_i的最大扩展大小。在全面的基准测试中,我们的算法在不牺牲任何质量的情况下,相对于重写和重构,实现了平均6.4倍的整体加速,驱动因素是层级维护的1074.8倍的加速。
英文摘要:
Logic optimization constitutes a critical phase within the Electronic Design Automation (EDA) flow, essential for achieving desired circuit power, performance, and area (PPA) targets. These logic circuits are typically represented as Directed Acyclic Graphs (DAGs), where the structural depth, quantified by node level, critically correlates with timing performance. Modern optimization strategies frequently employ iterative, local transformation heuristics (\emph{e.g.,} \emph{rewrite}, \emph{refactor}) directly on this DAG structure. As optimization continuously modifies the graph locally, node levels require frequent dynamic updates to guide subsequent decisions. However, a significant gap exists: existing algorithms for incrementally updating node levels are unbounded to small changes. This leads to a total of worst complexity in $O(|V|^2)$ for given local subgraphs $\{ΔG_i\}_{i=1}^{|V|}$ updates on DAG $G(V,E)$. This unbounded nature poses a severe efficiency bottleneck, hindering the scalability of optimization flows, particularly when applied to large circuit designs prevalent today. In this paper, we analyze the dynamic level maintenance problem endemic to iterative logic optimization, framing it through the lens of partial topological order. Building upon the analysis, we present the first bounded algorithm for maintaining level constraints, with $O(|V| Δ\log Δ)$ time for a sequence $|V|$ of updates $\{ΔG_i\}$, where $Δ= \max_i \|ΔG_i\|$ denotes the maximum extended size of $ΔG_i$. Experiments on comprehensive benchmarks show our algorithm enables an average 6.4$\times$ overall speedup relative to \rw and \rf, driven by a 1074.8$\times$ speedup in the level maintenance, all without any quality sacrifice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。