Seeing the Forest and the Trees: Steiner Wirelength Optimization in Placement
Seeing the Forest and the Trees: Steiner Wirelength Optimization in Placement
复制标题
见森林、见树木：施泰纳线长优化布局
DOI：
10.1145/1123008.1123024
复制
发表时间：
2006
影响因子：
2.9
通讯作者：
I. Markov
中科院分区：
文献类型：
--
作者：
Jarrod A. Roy;I. Markov
我们证明，Steiner-Tree WireLegenth（STWL）与路由线（RWL）的相关性要比更常见的半渗透线（HPWL）目标好得多。因此，我们开发了一种技术来优化全球和细节放置的STWL，而无需严重的运行时罚款。这种新的优化以及以拥堵为驱动的空间分配，改善了整体位置和路由结果，从而使HPWL不必要。此外，我们的经验结果提供了充分的证据，表明净长度估计的保真度比其适当的准确性更重要。使我们的最小算法快速的新数据结构也可以在多级分析位置中有用。我们的位置算法严格优化Steiner-Trees的路由（Rooster）优于Dragon，Capo，Fengshui，Mpl-R/WSA的最佳发布结果，而RWL的位置则优于10.7％，5.6％，5.6％，9.3％，5.5％，5.6％，5.5％ ，分别为4.2％。在90 nm及以下时尤其重要的通过计数比MPL-R/WSA提高了15.6％，而Aplace则提高了11.9％
We demonstrate that Steiner-tree wirelength (StWL) correlates with routed wirelength (rWL) much better than the more common half-perimeter wirelength (HPWL) objective. Therefore, we develop a technique to optimize StWL in global and detail placement without a significant runtime penalty. This new optimization, along with congestion-driven whitespace distribution, improves overall Place-and-Route results, making the use of HPWL unnecessary. Additionally, our empirical results provide ample evidence that the fidelity of net-length estimates is more important than their accuracy in Place-and-Route. The new data structures that make our min-cut algorithms fast can also be useful in multilevel analytical placement. Our placement algorithm Rigorous Optimization Of Steiner-Trees Eases Routing (ROOSTER) outperforms the best published results for Dragon, Capo, FengShui, mPL-R/WSA, and APlace in terms of rWL by 10.7%, 5.6%, 9.3%, 5.5%, and 4.2%, respectively. Via counts, which are especially important at 90 nm and below, are improved by 15.6% over mPL-R/WSA and 11.9% over APlace