Mixed Integer Programming models for detailed placement

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2012, Pages 87-94

  Li, Shuai ^a   Koh, Cheng Kok ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Detailed placement; MIP

Indexed keywords

BENCHMARK CIRCUIT; DANTZIG-WOLFE DECOMPOSITION; DETAILED PLACEMENT; INTEGER VARIABLES; MIP; MIXED INTEGER PROGRAMMING MODEL; OPTIMAL LOCATIONS; PLACEMENT OPTIMIZATION; PROBLEM INSTANCES; WIRE LENGTH;

COMPUTER PROGRAMMING;

OPTIMIZATION;

EID: 84860257488     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2160916.2160936     Document Type: Conference Paper

References (29)

1. C.-C. Chang and J. Cong. Optimality and scalability study of existing placement algorithms. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 23(4):537-549, April 2004.
2. T. Chan, J. Cong, T. Kong, and J. Shinnerl. Multilevel generalized force-directed method for circuit placement. In Proc. IEEE/ACM Intl. Conf. on Comput.-Aided Des., pages 171-176, 2000. (Pubitemid 32188463)
3. T. Chan, J. Cong, and K. Sze. Multilevel generalized force-directed method for circuit placement. In Proc. Intl. Symp. on Physical Design, pages 185-192, 2005. (Pubitemid 41816864)
4. A. B. Kahng and Q. Wang. Implementation and extensibility of an analytical placer. In Proc. Intl. Symp. on Physical Design, pages 18-25, 2004.
5. S. Ono and P. H. Madden. On structure and suboptimality in placement. In Proc. Asia South Pacific Design Automation Conf., 2005.
6. P. Ramachandaran, A. R. Agnihotri, S. Ono, P. Damodaran, K. Srihari, and P. H. Madden. Optimal placement by branch-and-price. In Proc. Asia South Pacific Design Automation Conf., pages 858-871, 2005.
7. A. R. Agnihotri, S. Ono, and P. H. Madden. Recursive bisection placement: feng shui 5.0 implementation details. In Proc. International Symposium on Physical Design, 2005.
8. A. B. Kahng, P. Tucker, and A. Zelikovsky. Optimization of linear placements for wirelength minimization with free sites. In Proc. Asia and South Pacific Design Autom. Conf., pages 241-244, 1999.
9. M. Pan, N. Viswanathan, and C. Chu. An efficient and effective detailed placement algorithm. In Proc. Int. Conf. Comput.-Aided Des., pages 48-55, 2005. (Pubitemid 44815697)
10. K. Doll, F. M. Johannes, and K. J. Antreich. Iterative placement improvement by network ow methods. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 13(10):1189-1200, 1994.
11. A. Agnihotri, M. C. Yildiz, A. Khatkhate, A. Mathur, S. Ono, and P. H. Madden. Fractional cut: Improved recursive bisection placement. In Proc. Int. Conf. Comput.-Aided Des., pages 307-310, 2003.
12. A. E. Caldwell, A. B. Kahng, and I. L. Markov. Optimal partitioners and end-case placers for standard-cell layout. IEEE Trans. on Computer-Aided Design, 19:1304-1313, 2007.
13. C. Li, M. Xie, C.-K. Koh, J. Cong, and P. H. Madden. Routability-driven placement and white space allocation. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 26(5):858-871, May 2007. (Pubitemid 46748271)
14. S. Cauley, V. Balakrishnan, Y. C. Hu, and C.-K. Koh. A parallel branch-and-cut approach for detailed placement. ACM Transactions on Design Automation of Electronic Systems, 16(2), March 2011.
15. M. Padberg and G. Rinaldi. Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Operations Research Letters, 6(1):1-7, Mar. 1987. (Pubitemid 17601864)
16. http://www.tsp.gatech.edu/.
17. C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance. Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3):316-329, May - Jun. 1998. (Pubitemid 128655433)
18. M. Desrochers, J. Desrosiers, and M. M. Solomon. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2):342-354, 1992.
19. P. H. Vance, C. Barnhart, E. L. Johnson, and G. L. Nemhauser. Airline crew scheduling: A new formulation and decomposition algorithm. Operations Research, 45:188-200, 1997. (Pubitemid 127684698)
20. T.-H. Wu, A. Davoodi, and J. T. Linderoth. GRIP: Scalable 3D global routing using integer programming. In Proc. Proc. Design Automation Conf., pages 320-325, 2009.
21. T.-H. Wu, A. Davoodi, and A. Zelikovsky. A parallel integer programming approach to global routing. In Proc. Design Automation Conf., 2010.
22. F. Vanderbeck. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research, 48(1):111-128, Jan. - Feb. 2000.
23. W. E. Wilhelm. A technical review of column generation in integer programming. Optimization and Engineering, 2:159-200, 2001.
24. X. Yang, B.-K. Choi, and M. Sarrafzadeh. Routability-driven white space allocation for fixed-die standard-cell placement. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 22(4):410-419, April 2003.
25. K. Tsota. Algorithms and methodologies for routability-driven VLSI placement. Ph.D. Dissertation, Purdue University, 2011.
26. P. Spindler and F. Johannes. Fast and accurate routing demand estimation for efficient routability-driven placement. In Proc. Design Automation and Test in Europe Conference, pages 1-6, 2007.
27. C. Li and C.-K. Koh. Recursive function smoothing of half-perimeter wirelength for analytical placement. In Proc. International Symposium on Quality Electronic Design, pages 829-834, 2007. (Pubitemid 47298291)
28. A. B. Kahng and Q. Wang. Implementation and extensibility of an analytic placer. IEEE Trans. Computer-Aided Design, 24(5):734-747, May 2005. (Pubitemid 40671909)
29. T. Chan, J. Cong, M. Romesis, J. R. Shinnerl, K. Sze, and M. Xie. mPL6: A robust multilevel mixed-size placement engine. pages 227-229, Apr. 2005.