Congestion reduction during placement with provably good approximation bound

ACM Transactions on Design Automation of Electronic Systems

Volumn 8, Issue 3, 2003, Pages 316-333

  Yang, X ^a   Wang, M ^b   Kastner, R ^c   Ghiasi, S ^d   Sarrafzadeh, M ^d  

^a Synplicity Inc   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

^c University of California   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Congestion; Physical design; Placement; Routability

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DESIGN AIDS; INTEGER PROGRAMMING; INTEGRATED CIRCUIT LAYOUT; LINEAR PROGRAMMING;

CONGESTION REDUCTION; ROUTABILITY; ROUTING CONGESTION;

COMPUTER AIDED DESIGN;

EID: 0042745487     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/785411.785414     Document Type: Article

References (17)

1. Cheng, C. E. 1994. "RISA: Accurate and Efficient Placement Routability Modeling". In International Conference on Computer-Aided Design, pages 690-695.
2. Caldwell, A. E., Kahng, A. B., and Markov, I. L. 2000. "Can Recursive Bisection Alone Produce Routable Placements?" In Design Automation Conference, pages 477-482.
3. Cong, J. and Madden, P. 1998. "Performance Driven Multi-Layer General Area Routing for PCB/MCM Designs." In Design Automation Conference, pages 356-361.
4. Dunlop, A. E. and Kernighan, B. W. 1985. "A Procedure for Placement of Standard Cell VLSI Circuits." IEEE Trans. Comput. Aided Design, 4, 1, 92-98.
5. ERLAB(a). "IBM-Place benchmark." http://er.cs.ucla.edu/benchmarks/ibm-place/.
6. ERLAB(b). "Labyrinth." http://www.cs.ucla.edu/~kastner/labyrinth/.
7. Kahng, A. B., Mantik, S., and Stroobandt, D. 2000. "Requirements for Models of Achievable Routing." In International Symposium on Physical Des. pages 4-11.
8. Kleinhans, J. M., Sigl, G., Johannes, F. M., and Antreich, K. J. "Gordian: VLSI Placement by Quadratic Programming and Slicing Optimization." IEEE Trans. Comput. Aided Des. 10, 3, 365-365.
9. Lou, J., Krishnamoorthy, S., and Sheng, H. S. 2001. "Estimating Routing Congestion using Probabilistic Analysis." In International Symposium on Physical Design, pages 112-117.
10. Mayrhofer, S. and Lauther, U. 1990. "Congestion-Driven Placement Using a New Multi-partitioning Heuristic." In International Conference on Computer-Aided Design, pages 332-335.
11. Parakh, P. N., Brown, R. B., and Sakallah, K. A. 1998. "Congestion Driven Quadratic Placement." In Design Automation Conference, pages 275-278.
12. Sun, W. J. and Sechen, C. 1995. "Efficient and Effective Placement for Very Large Circuits." IEEE Trans. Comput. Aided Des. 14, 3, 349-359.
13. Tsay, R. S. and Chang, S. C. 1992. "Early Wirability Checking and 2-D Congestion-Driven Circuit Placement." In International Conference on ASIC. pages 50-53.
14. Wang, M., Yang, X., Eguro, K., and Sarrafzadeh, M. 2000a. "Multi-Center Congestion Estimation and Minimization During Placement." In International Symposium on Physical Design, pages 147-152.
15. Wang, M., Yang, X., and Sarrafzadeh, M. 2000b. "Congestion Minimization During Top-Down Placement." IEEE Trans. Comput. Aided Des. 19, 10, 1140-1148.
16. Wang, M., Yang, X., and Sarrafzadeh, M. 2000c. "Dragon2000: Fast Standard-cell Placement for Large Circuits." In International Conference on Computer-Aided Design, pages 260-263.
17. Yang, X., Kastner, R., and Sarrafzadeh, M. 2001. "Congestion Estimation During Top-down Placement." In International Symposium on Physical Design, pages 164-169.