VLSI legalization with minimum perturbation by iterative augmentation

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2012, Pages 1385-1390

  Brenner, Ulrich ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CONTRACTS; COST ACCOUNTING; VLSI CIRCUITS;

CELL MOVEMENT; GLOBAL PERSPECTIVE; LOCAL SEARCH ALGORITHM; MINIMUM COST FLOWS; NEW APPROACHES; REAL-WORLD DESIGNS; REALIZATION PROBLEMS; VLSI PLACEMENT;

ITERATIVE METHODS;

EID: 84862104585     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/date.2012.6176579     Document Type: Conference Paper

References (21)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993).
2. U. Brenner and J. Vygen: Legalizing a placement with mimimum total movement. TCAD (2004), 23, 12, 1597-1613.
3. T.-C. Chen, Z.-W- Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang: NTUplace3: An analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints. TCAD (2008), 27, 7, 1228-1240.
4. M. Cho, H. Ren, H. Xiang, and R. Puri: History-based VLSI legalization using network flow. DAC (2010), 286-291.
5. J. Cong and M. Xie: A robust mixed-size legalization and detailed placement algorithm. TCAD (2008), 27, 8, 1349-1362.
6. E.W. Dijkstra: A note on two problems in connexion with graphs. Numerische Mathematik (1959), 1, 269-271.
7. K. Doll, F.M. Johannes, and K.J. Antreich: Iterative placement improvement by network flow methods. TCAD (1994), 13, 10, 1189-1200.
8. M.R. Garey, R.E. Tarjan, and G.T. Wilfong: One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Researchs, 13,2 (1988), 330-348.
9. D. Hill: Method and system for high speed detailed placement of cells within an integrated circuit design. U.S. Patent, 6370673 (2002).
10. T.-Y. Ho and S.-H. Liu: Fast legalization for standard cell placement with simultaneous wirelength and displacement minimization. VLSI-SoC (2010), 369-374.
11. S.-W. Hur and J. Lillis: Mongrel: Hybrid techniques for standard cell placement. ICCAD (2000), 165-170.
12. ISPD 2006 placement contest. http://www.sigda.org/ispd2006/contest.html
13. A. Kahng, P. Tucker, and A. Zelikovsky: Optimization of linear placements for wirelength minimization with free sites. ASPDAC (1999), 241-244.
14. A. Khatkhate, C. Li, A.R. Agnihotri, M. Yildiz, S. Ono, C.-K. Koh, P.H. Madden: Recursive bisection based mixed block placement. ISPD (2004), 84-89.
15. J.B. Orlin: A faster strongly polynomial minimum cost flow algorithm. Operations Research (1993), 41, 338-350.
16. M. Pan, N. Viswanathan, and C. Chu: An efficient and effective detailed placement algorithm. ICCAD (2005), 48-55.
17. H. Ren, D.Z. Pan, C.J. Alpert, and P. Villarubia: Diffusion-based placement mitigation. DAC (2005), 515-520.
18. P. Spindler, U. Schlichtmann, and F.M. Johannes: Abacus: Fast legalization of standard cell circuits with minimal movement. ISPD (2008), 47-53.
19. M. Struzyna: Flow-based partitioning and position constraints in VLSI placement. DATE (2011), 607-612.
20. T. Taghavi, X. Yang, B.-K. Choi, M. Wang, and M- Sarrafzadeh: Dragon2006: blockage-aware congestion-controlling mixed-size placer. ISPD (2006), 209-211.
21. N. Viswanathan, M. Pan, and C. Chu: Fastplace 3.0: a fast multi-level quadratic placement algorithm with placement congestion control. ASPDAC (2007), 36-41.