A parallel branch-and-cut approach for detailed placement

ACM Transactions on Design Automation of Electronic Systems

Volumn 16, Issue 2, 2011, Pages

  Cauley, Stephen ^a   Balakrishnan, Venkataramanan ^a   Hu, Y Charlie ^a   Koh, Cheng Kok ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Detailed placement; MIP; Parallel

Indexed keywords

BRANCH-AND-CUT; COMMERCIAL SOFTWARE; COMPUTING RESOURCE; CUTTING PLANES; DECISION VARIABLES; DETAILED PLACEMENT; DISTRIBUTED COMPUTING ENVIRONMENT; DISTRIBUTED COMPUTING RESOURCES; DISTRIBUTING COMPUTING; FEASIBLE REGIONS; INTEGER SOLUTIONS; MIP; MIXED INTEGER PROGRAMMING MODEL; OPTIMIZATION ALGORITHMS; OPTIMIZATION PROCEDURES; OPTIMIZATION STRATEGY; PARALLEL; PHYSICAL DESIGN; PLACEMENT STRATEGY; PROBLEM STRUCTURE; RUNTIMES; STANDARD-CELL PLACEMENT; WIRE LENGTH;

ALGORITHMS; ELECTRIC BATTERIES; OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 79953848782     PISSN: 10844309     EISSN: 15577309     Source Type: Journal    
DOI: 10.1145/1929943.1929950     Document Type: Article

References (14)

1. Applegate, D., Bixby, R., Chvatal, V., and Cook, W. 1995. Finding cutis in the TSP (a preliminary report). Tech. rep., DIMACS Tchnical Report 95-05. Mar.
2. Chan, T., Cong, J., Shinnerl, J., Sze, K., and Xie, M. 2006. mPL6: Enhanced multilevel mixed-size placement. In Proceedings of the International Symposium on Physical Design. 212-214. (Pubitemid 44063427)
3. Chan, T., Cong, J., and Sze, K. 2005. Multilevel generalized force-directed method for circuit placement. In Proceedings of the International Symposium on Physical Design. 185-192. (Pubitemid 41816864)
4. Chen, T.-C., Jiang, Z.-W., Hsu, T.-C., Chen, H.-C., and Chang, Y.-W. 2008. NTUplace3: An analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints. IEEE Trans. Comput-Aid. Des. Integr. Circ. Syst. 27, 3, 1228-1240.
5. Kahng, A. and Wang, Q. 2006. A faster implementation of aplace. In Proceedings of the International Symposium on Physical Design. 218-220. (Pubitemid 44059921)
6. Khatkhate, A., Li, C., Agnihotri, A., Yildiz, M., Ono, S., Koh, C.-K., and Madden, P. 2004. Recursive bisection based mixed block placement. In Proceedings of the International Symposium Conference on Physical Design. 84-89.
7. Kravitz, S. and Rutenbar, R. 1987. Placement by simulated annealing on a multiprocessor. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 6, 4, 534-549.
8. Li, C., Xie, M., Koh, C.-K., Cong, J., and Madden, P. 2007. Routability-driven placement and white space allocation. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 26, 5, 858-871. (Pubitemid 46748271)
9. Luenberger, D. 2003. Linear and Nonlinear Programming . Springer.
10. Mohan, J. 1982. A study in parallel computation - the traveling salesman problem. Tech. rep., CMU-CS-82-136, Computer Science Department, Carnegie Mellon University.
11. Ramachandaran, P., Agnihotri, A.R., Ono, S., Damodaran, P., Srihari, K., and Madden, P. H. 2005. Optimal placement by branch-and-price. In Proceedings of the Asia South Pacific Design Automation Conference 337-342.
12. Spindler, P. and Johannes, F. 2006. Fast and robust quadratic placement combined with an exact linear net model. In Proceedings of the Conference on Computer Aided Design. 179-186.
13. Wagner, H. 1975. Principles of Operational Research. Prentice-Hall.
14. Xing, Z. and Banerjee, P. 1996. A parallel hierarchical algorithm for module placement based on sparse linear equations. In Proceedings of the International Symposium on Circuits and Systems. Vol. 4. 691-694.