一种快速的最优双行合法化算法
A Fast Optimal Double Row Legalization Algorithm
摘要:
在Placement Legalization中,通常假设(几乎)所有标准单元格都具有相同的高度,因此可以在单元格行中对齐,然后可以独立处理。然而,这对于最近的技术不再是真实的,其中预期大量的双行高度或甚至任意多行高度的电池。由于几行内单元格位置之间的相互依赖性,合法化任务变得相当困难。在本文中,我们展示了如何优化二次细胞运动对相邻行包括细胞的单行以及双行高度与固定的左到右的时间顺序$\mathcal{O}(n\cdot\log(n))$,其中$n$表示所涉及的细胞的数量。与现有的工作相反,我们因此不人为地限制最大细胞运动,并可以保证找到最佳解决方案。实验结果表明,在总的二次运动中,当与在全局放置之后固定多于单行高度的单元的合法化方法相比时,平均增量减少超过$26\%$。
英文摘要:
In Placement Legalization, it is often assumed that (almost) all standard cells possess the same height and can therefore be aligned in cell rows, which can then be treated independently. However, this is no longer true for recent technologies, where a substantial number of cells of double- or even arbitrary multiple-row height is to be expected. Due to interdependencies between the cell placements within several rows, the legalization task becomes considerably harder. In this paper, we show how to optimize quadratic cell movement for pairs of adjacent rows comprising cells of single- as well as double-row height with a fixed left-to-right ordering in time $\mathcal{O}(n\cdot\log(n))$, whereby $n$ denotes the number of cells involved. Opposed to prior works, we thereby do not artificially bound the maximum cell movement and can guarantee to find an optimum solution. Experimental results show an average percental decrease of over $26\%$ in the total quadratic movement when compared to a legalization approach that fixes cells of more than single-row height after Global Placement.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。