Almost optimum placement legalization by minimum cost flow and dynamic programming

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2004, Pages 2-9

  Brenner, Ulrich ^a   Pauli, Anna ^a   Vygen, Jens ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Detailed placement; Legalization; Minimum cost flow; Placement

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; INTEGRATED CIRCUIT LAYOUT; LINEAR PROGRAMMING; MICROPROCESSOR CHIPS; PROBLEM SOLVING;

DETAILED PLACEMENT; LEGALIZATION; MINIMUM COST FLOW; PLACEMENT;

VLSI CIRCUITS;

EID: 2942630783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/981066.981069     Document Type: Conference Paper

References (15)

1. U. Brenner, J. Vygen: Faster optimal single-row placement with fixed ordering. DATE (2000), 117-121
2. U. Brenner, J. Vygen: Legalizing a placement with minimum total movement. Report No. 03925-OR, Research Institute for Discrete Mathematics, University of Bonn, 2003
3. K. Doll, F.M. Johannes, K.J. Antreich: Iterative placement improvement by network flow methods. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 13 (1994), 1189-1199
4. K. Doll, F.M. Johannes, G. Sigl: DOMINO: deterministic placement improvement with hill-climbing capabilities. IFTP International Conference on VLSI (1991) 91-100
5. O. Faroe, D. Pisinger, M. Zachariasen: Guided local search for final placement in VLSI design. Journal of Heuristics 9 (2003), 269-295
6. M.R. Garey, D.S. Johnson: Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing 4 (1975), 397-411
7. M.R. Garey, R.E. Tarjan, G.T. Wilfong: One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13 (1988) 330-348
8. S.-W. Hur, J. Lillis: Mongrel: hybrid techniques for standard cell placement. ICCAD (2000), 165-170
9. A.B. Kahng, P. Tucker, A. Zelikovsky: Optimization of linear placements for wirelength minimization with free sites. ASPDAC (1999), 241-244
10. B. Korte, J. Vygen: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin 2000. Second edition 2002
11. M. Sarrafzadeh, M. Wang: NRG: global and detailed placement. ICCAD (1997), 532-537
12. C. Sechen: VLSI Placement and Global Routing Using Simulated Annealing. Kluwer, Boston 1988
13. J. Vygen: Algorithms for detailed placement of standard cells. DATE (1998), 321-324
14. M. Wang, X. Yang, M. Sarrafzadeh: DRAGON2000: standard-cell placement tool for large industry circuits. ICCAD (2000), 260-263
15. D.F. Wong. H.W. Leong, C.L. Liu: Simulated Annealing for VLSI Design. Kluwer. Boston 1988