On wirelength estimations for row-based placement

被引:42
作者
Caldwell, AE [1 ]
Kahng, AB
Mantik, S
Markov, IL
Zelikovsky, A
机构
[1] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
[2] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30303 USA
基金
美国国家科学基金会;
关键词
interconnect estimation; online algorithms; row-based placement; standard cell placement; Steiner-tree; top-down placement; very large scale integration (VLSI); wirelength estimation;
D O I
10.1109/43.784119
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Wirelength estimation in very large scale integration layout is fundamental to any predetailed routing estimate of timing or routability. In this paper, we develop efficient wirelength estimation techniques appropriate for wirelength estimation during top-down floorplanning and placement of cell-based designs. Our methods give accurate, linear-time approaches, typically with sublinear time complexity for dynamic updating of estimates (e.g,, for annealing placement). Our techniques offer advantages not only for early on-line wirelength estimation during top down placement, but also for a posteriori estimation of routed wirelength given a final placement. In developing these new estimators, we have made several contributions, including 1) insight into the contrast between region-based and bounding box-based rectilinear Steiner minimal tree (RStMT) estimation techniques; 2) empirical assessment of the correlations between pin placements of a multipin net that is contained in a block; and 3) new wirelength estimates that are functions of a block's complexity (number of cell instances) and aspect ratio.
引用
收藏
页码:1265 / 1278
页数:14
相关论文
共 23 条
[1]  
[Anonymous], P CAMB PHILO SOC, DOI DOI 10.1017/S0305004100034095
[2]   LARGEST MINIMAL RECTILINEAR STEINER TREES FOR A SET OF N POINTS ENCLOSED IN A RECTANGLE WITH GIVEN PERIMETER [J].
CHUNG, FRK ;
HWANG, FK .
NETWORKS, 1979, 9 (01) :19-36
[3]  
DONATH WE, 1979, IEEE T CIRCUITS SYST, V26, P273
[4]  
ELGAMAL AA, 1981, IEEE T CIRCUITS SYST, V28, P127, DOI 10.1109/TCS.1981.1084958
[5]  
FEUER M, 1982, IEEE T COMPUT, V31, P29, DOI 10.1109/TC.1982.1675882
[6]   CLOSING THE GAP - NEAR-OPTIMAL STEINER TREES IN POLYNOMIAL-TIME [J].
GRIFFITH, J ;
ROBINS, G ;
SALOWE, JS ;
ZHANG, TT .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1994, 13 (11) :1351-1365
[7]  
Hamada T., 1992, Proceedings. 29th ACM/IEEE Design Automation Conference (Cat. No.92CH3144-3), P57, DOI 10.1109/DAC.1992.227861
[8]  
HEBGEN W, 1996, P PHYS DES WORKSH, P118
[9]   STEINER MINIMAL TREES WITH RECTILINEAR DISTANCE [J].
HWANG, FK .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1976, 30 (01) :104-115
[10]   Efficient gate delay modeling for large interconnect loads [J].
Kahng, AB ;
Muddu, S .
1996 IEEE MULTI-CHIP MODULE CONFERENCE, PROCEEDINGS, 1996, :202-207