PeF:基于泊松方程的大规模固定轮廓布图规划
PeF: Poisson's Equation Based Large-Scale Fixed-Outline Floorplanning
摘要:
布图规划是超大规模集成电路物理设计的第一步。一个有效的布图规划引擎对芯片设计速度、质量和性能都有积极的影响。在本文中,我们提出了一种新的数学模型来表征非重叠的模块,并提出了一个平面固定轮廓布图规划算法的基础上的VLSI全局布局方法,使用泊松方程。该算法包括全局布图规划和合法化阶段。在全局布图规划中,我们重新定义的基础上的新的数学模型来表征模块的非重叠和泊松方程的解析解的每个模块的势能。在该方案中,软模块的宽度作为能量函数中的变量出现,并且可以被优化。此外,我们设计了一个快速近似计算方案的势能偏导数。在合法化中,基于定义的水平和垂直约束图,通过修改模块的相对位置,消除全局布图规划后剩余的模块之间的重叠。在MCNC、GSRC、HB+和ami49x基准测试上的实验表明,与现有的布图规划器相比,在小规模和大规模基准测试上,该算法在一定的空白空间下,平均线长分别提高了2%和5%以上.
英文摘要:
Floorplanning is the first stage of VLSI physical design. An effective floorplanning engine definitely has positive impact on chip design speed, quality and performance. In this paper, we present a novel mathematical model to characterize non-overlapping of modules, and propose a flat fixed-outline floorplanning algorithm based on the VLSI global placement approach using Poisson's equation. The algorithm consists of global floorplanning and legalization phases. In global floorplanning, we redefine the potential energy of each module based on the novel mathematical model for characterizing non-overlapping of modules and an analytical solution of Poisson's equation. In this scheme, the widths of soft modules appear as variables in the energy function and can be optimized. Moreover, we design a fast approximate computation scheme for partial derivatives of the potential energy. In legalization, based on the defined horizontal and vertical constraint graphs, we eliminate overlaps between modules remained after global floorplanning, by modifying relative positions of modules. Experiments on the MCNC, GSRC, HB+ and ami49\_x benchmarks show that, our algorithm improves the average wirelength by at least 2\% and 5\% on small and large scale benchmarks with certain whitespace, respectively, compared to state-of-the-art floorplanners.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。