ABSTRACT
Wirelength estimation in VLSI layout is fundamental to any pre-detailed routing estimate of timing or routability. In this paper, we develop new wirelength estimation techniques appropriate for top-down floor-planning and placement synthesis of row-based VLSI layouts. Our methods include accurate, linear-time approaches, often with sublinear time complexity for dynamic updating of estimates (e.g., for annealing placement). The new 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 theoretical contributions. Notably, we have resolved the long-standing discrepancy between region-based and bounding box-based RSMT estimation techniques; this leads to new estimates that are functions of instance size n and aspect ratio AR.
- 1.J. Beardwood, l H. Halton, and I. M. Hammersley. The shortest path through m~ny points. In Proceedings of the Cambridge PMiosophicd Society55, pages 299-327, 1959.Google Scholar
- 2.C.-LE. Cheng. Rism Aceumteand effieientplacementroutability mofleaing. In Proceedings IEEEInternational Conf. on Computer- AidedDes/gn, pages 690--695,1994. Google ScholarDigital Library
- 3.E R. K. Chnng and F. K. Hwang. The largest minimal rectilinear steiner trees for aset ofn points enclosed in a rectangle with given perimeter. Networks, 9(1):19--36, Spring 1979.Google ScholarCross Ref
- 4.W. E,. Donath. Placement and average interconnection lengths of computer logic. IEF~ Transactions on Circuits and Systems, CAS-26(4):272-277, April 1979.Google Scholar
- 5.A.A. El Gamal. TWoMimensional stochastic model for interconnections in master slice integrated circuits./EEE Transactions on Cimtdts and Systems, CAS-28(2):127-138, February 1981.Google Scholar
- 6.M. Feu~ Connectivity of random logic. LEEE Transactions on Computers, (2-31 (1):29-33, January 1982.Google Scholar
- 7.J. Grifiith, G.Robins, J. S. Salowe, and T. Zhang. Closing the gap: Near-optimal steiner trees in polynomial time. IEEE Transactions on Computer-Aided Design of Integrated Circuits arm Systems, 13(11):1351-1365, November 1994.Google ScholarDigital Library
- 8.T. Hamada, C-K. Cheng, and P. M. Chau. A wire length estimation techr~que ufiliziug neighborhood density equations. In Prec. ACM/IEEEDesignAutomation Conf., pages 57-61, 1992. Google ScholarDigital Library
- 9.W. Hebgen and G. Zimmelxnanm Hierarchical netlength estimation for timing prediction. In Proceedings of the ACM/SIGDA Physical Design Workshop, pages 118-125, 1996.Google Scholar
- 10.E K. Hwang. On steiner minimal trees with rectilinear distance. Siam Journal of Applied Mathematics, pages 104-114, January 1976.Google ScholarCross Ref
- 11.A. B. Kahng and S. Muddm Efficient gate delay modeling for large interconnect loads. In Proceedings of the IEEE Multi-Chip Module Conference, pages 202-207,1996. Google ScholarDigital Library
- 12.A. B. Katmg and G. Robins. On Optimal Interconnections for VLSI. Kluwer, 1994.Google Scholar
- 13.M. Pedram and B. Preas. Intercormection length estimation for optimized standard cell layouts. In Proceedings IEEE International Conf. on Computer-Aided Design, pages 390-393, 1989.Google Scholar
- 14.C. Sechen. Average interconneetion length estimation for random and optimized placements. In Proceedings IEEE International Conf. on Computer-Aided Design, pages 190-193, 1987.Google Scholar
- 15.T. L. Snyder and J. M. Steele. A priori bounds on the euclidean traveling salesman. SIAM Journal of Computing, 24(3):665-671, June 1995. Google ScholarDigital Library
- 16.I. M. Steele. Growth rates of euclidean minimal spanning trees with power weighted edges. Annals of Probability, 16(4):1767- 1787, 1988.Google ScholarCross Ref
- 17.L M. Steele and T. L. Snyder. Worst-ease growth rates of some classical problems of combinatorial optimization. SlAM Journal of Computing, 18(2):278-287, 1989. Google ScholarDigital Library
- 18.D. Stroobandt. Improving Donath's technique for estimating the average interconnection length in computer logic. Technical report, Univ. Ghent ELIS Dept., June 1996.Google Scholar
Index Terms
On wirelength estimations for row-based placement
Recommendations
On wirelength estimations for row-based placement
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 ...
Blockage-aware terminal propagation for placement wirelength minimization
ICCAD '17: Proceedings of the 36th International Conference on Computer-Aided DesignWirelength is the most fundamental objective in placement because it also affects various placement metrics (routability, timing, etc.). Half-perimeter wirelength (HPWL) is a pervasive metric for circuit placement. However, preplaced blocks (i.e., ...
Wirelength minimization for min-cut placements via placement feedback
The advent of strong multilevel partitioners has made top-down min-cut placers a favored choice for modern placer implementations. Terminal propagation is an important step in min-cut placers because it translates partitioning results into global-...
Comments