Faster and better global placement by a new transportation algorithm

Proceedings - Design Automation Conference

Volumn , Issue , 2005, Pages 591-596

  Brenner, Ulrich ^a   Struzyna, Markus ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Global Placement; Transportation Problem; VLSI Placement

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BENCHMARKING; NETWORKS (CIRCUITS);

QUADRATIC NET LENGTH; VLSI PLACEMENT ALGORITHMS;

VLSI CIRCUITS;

EID: 27944488404     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dac.2005.193879     Document Type: Conference Paper

References (26)

1. S.N. Adya, I.L. Markov: Consistent Placement of Macro-Blocks using floorplanning and standard-cell placement. ISPD (2002) 12-17.
2. S.N. Adya, I.L. Markov, P.G. Villarubia: On whitespace in mixed-size placement and physical synthesis. ICC AD (2003), 311-318.
3. S.N. Adya, I.L. Markov: Combinatorial techniques for mixed-size placement, to appear in: ACM Transactions on Design Automation of Electronic Systems (2004).
4. C.J. Alpert: The ISPD98 circuit benchmark suite. ISPD (1998) 85-90.
5. C.J. Alpert, T. Chan., D. J.-H. Huang, I.L. Markov, K. Van: Quadratic placement Revisited, Design Automation Conference (1997) 752-757.
6. C.J. Alpert, A.B. Kahng: Recent directions in netlist partitioning: a survey. Integration, the VLSI Journal 19 (1995), 1-81.
7. U. Brenner, A. Pauli, J. Vygen: Almost optimum placement legalization by minimum cost flow and dynamic programming. ISPD (2004) 2-9.
8. M.A. Breuer: Min-cut placement. Journal of Design, Automation and Fault-Tolerant Computing 1, 4 (1977) 343-382.
9. A.E. Caldwell, A.B. Kahng, I.L. Markov: Can recursive bisection alone produce routable placements? DAC (2000) 477-482.
10. T. Chan, J. Cong, K. Sze, K: Multilevel generalized force-directed method for circuit placement. ISPD (2005).
11. C.C. Chang, J. Cong, M. Xie: Optimality and scalability of existing placement algorithms. ASP-DAC (2003), 621-627.
12. C.C. Chang, J. Cong, X. Yuan: Multi-level placement for large-scale mixed-size ic designs. ASP-DAC (2003), 325-330.
13. H. Eisenmann, F.M. Johannes: Generic global placement and floorplanning. DAC (1998), 269-274.
14. D.J. Huang, A.B. Kahng: Partitioning-based standard cell global placement with an exact objectice. ISPD (1997), 18-25.
15. ISPD02 benchmarks: http://vlsicad.eecs.umich.edu/BK/ISPD02bench/
16. A. Khatkate, C. Li, A.R. Angihotri, M.C. Yildiz, S. Ono, C.-K. Koh, P. Madden.: Recursive bisection based mixed block placement, ISPD (2004), 84-89.
17. J. Kleinhans, G. Sigl, F. Johannes, K. Antreich: GORDIAN: VLSI Placement by Quadratic Programming and Slicing Optimization, IEEE Trans. on Computer-Aided Design 10 (3), 356-365 (1991).
18. B. Korte, J. Vygen: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin 2002, second edition 2002.
19. J.B. Orlin: A faster strongly polynomial minimum cost flow algorithm. Operations Research 41 (1993), 338-350.
20. PEKO benchmarks: http://ballade.cs.ucla.edu/ pubbench/placement
21. M. Struzyna: Analytisches Placement im VLSI-Design, Diploma thesis, University of Bonn (2004) (in German)
22. T. Tokuyama, J. Nakano: Efficient algorithms for the Hitchcock transportation problem. SIAM Journal on Computing 24 (1995), 563-578.
23. N. Viswanathan, C. Chu: FastPlace: efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model, ISPD(2004), 26-33.
24. K. Vorwerk, A. Kennings, A. Vannelli: Engineering Details of a Stable Force-Directed Placer, ICCAD (2004), 7-11.
25. J. Vygen: Plazierung im VLSI-Design und ein zweidimensionales Zerlegungsproblem. Ph.D thesis. University of Bonn (1997) (in German).
26. J. Vygen: Algorithms for large-scale flat placement. Design Automation Conference (1997) 746-751.