DPlace2.0: A stable and efficient analytical placement based on diffusion
DPlace2.0: A stable and efficient analytical placement based on diffusion
复制标题
DOI：
10.1109/aspdac.2008.4483972
复制
发表时间：
2008-01
期刊：
影响因子：
--
通讯作者：
T. Luo;D. Pan
中科院分区：
文献类型：
--
作者：
T. Luo;D. Pan
如今，放置问题通常涉及数百万个对象和过多的固定障碍。我们提出了一种新的全局布局算法，可以很好地解决现代大规模电路布局问题。我们模拟自然扩散过程，将细胞平滑地扩散到放置区域，并使用分析和离散技术来改善线长度。尽管任何分析线长度技术都可以在我们的新框架中使用，但通过使用二次线长度模型，我们的公式的粗麻布与传统公式相比非常稀疏，这使二次求解器的速度提高了 24 倍。我们还提出了一种线线性化技术，将二次星模型精确地转换为 HPWL。我们工具的整体运行时间接近现有文献中最快的放置工具，并且明显优于其他工具。同时，我们获得了与最知名的产品相比具有竞争力的线长度结果。平均总线长比 mPL6 高 2.2%，分别比 FastPlace3.0、APlace2.0 和 Capol0.2 好 0.2%、3.1% 和 9.1%。
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-scale circuit placement problems. We simulate the natural diffusion process to spread cells smoothly over the placement region, and use both analytical and discrete techniques to improve the wire length. Although any analytical wire length technique can be used in our new framework, by using the quadratic wire length model, the hessian of our formulation is extremely sparse compared with conventional formulations, which brings 24x speed up on quadratic solver. We also propose a wire linearization technique that transform quadratic star model into HPWL exactly. The overall runtime of our tool is close to the fastest placement tool in existing literature and significantly better than others. And meanwhile, we obtain competitive wire length results to the best known ones. The average total wire length is 2.2% higher than mPL6, 0.2%, 3.1%, and 9.1% better than FastPlace3.0, APlace2.0, and Capol0.2 respectively.