Fractional cut: Improved recursive bisection placement

被引:50
作者
Agnihotri, A [1 ]
Yildiz, MC [1 ]
Khatkhate, A [1 ]
Mathur, A [1 ]
Ono, S [1 ]
Madden, PH [1 ]
机构
[1] SUNY Binghamton, Dept Comp Sci, Binghamton, NY 13902 USA
来源
ICCAD-2003: IEEE/ACM DIGEST OF TECHNICAL PAPERS | 2003年
关键词
D O I
10.1109/ICCAD.2003.1257685
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we present improvements to recursive bisection based placement. In contrast to prior work, our horizontal cut lines are not restricted to row boundaries; this avoids a "narrow region" problem. To support these new cut line positions, a dynamic programming based legalization algorithm has been developed. The combination of these has improved the stability and lowered the wire lengths produced by our Feng Shui placement tool. On benchmarks derived from industry partitioning examples, our results are close to those of the annealing based tool Dragon, while taking only a fraction of the run time. On synthetic benchmarks, our wire lengths are nearly 23% better than those of Dragon. For both benchmark suites, our results are substantially better than those of the recursive bisection based tool Capo and the analytic placement tool Kraftwerk.
引用
收藏
页码:307 / 310
页数:4
相关论文
共 18 条