Recursive bisection placement: Feng shui 5.0 implementation details

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2005, Pages 230-232

  Agnihotri, Ameya R ^a   Ono, Satoshi ^b   Madden, Patrick H ^b  

^a BINGHAMTON UNIVERSITY   (United States)

^b UNIVERSITY OF KITAKYUSHU   (Japan)

Author keywords

Floorplanning; Mixed block design; Placement

Indexed keywords

FLOORPLANNING; MIXED BLOCK DESIGN; PLACEMENT;

ALGORITHMS; INTEGRATED CIRCUIT LAYOUT; RECURSIVE FUNCTIONS;

INTEGRATED CIRCUITS;

EID: 29144534646     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. S. N. Adya, I. L. Markov, and P. G. Villarrubia. On whitespace in mixed-size placement and physical synthesis. In Proc. Int. Conf. on Computer Aided Design, pages 311-318, 2003.
2. 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. on Computer Aided Design, pages 307-310, 2003.
3. M. A. Breuer. A class of min-cut placement algorithms. In Proc. Design Automation Conf. pages 284-290, 1977.
4. A. E. Caldwell, A. B. Kahng, and I. L. Markov. Can recursive bisection alone produce routable placements? In Proc. Design Automation Conf, pages 477-482, 2000.
5. C. C. Chang, J. Cong, , and X. Yuan. Multi-level placement for large-scale mixed-size ic designs. In Proc. Asia South Pacific Design Automation Conf., pages 325-330, 2003.
6. C. C. Chang, J. Cong, and M. Xie. Optimality and scalability study of existing placement algorithms. In Proc. Asia South Pacific Design Automation Conf., pages 621-627, 2003.
7. A. E. Dunlop and B. W. Kernighan. A procedure for placement of standard-cell VLSI circuits. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems. CAD-4(1):92-98, January 1985.
8. H. Eisenmann and F. M. Johannes. Generic global placement and floorplanning. In Proc. Design Automation Conf, pages 269-274, 1998.
9. D. Hill. US patent 6.370,673: Method and system for high speed detailed placement of cells within an integrated circuit design, 2002.
10. D. J.-H. Huang and A. B. Kahng. Partitioning based standard cell global placement with an exact objective. In Proc. Int. Symp. on Physical Design, pages 18-25, 1997.
11. A. B. Kahng and S. Reda. Placement feedback: A concept and method for better min-cut placements. In Proc. Design Automation Conf, pages 357-362, 2004.
12. A. Khatkhate, C. Li, A. R. Agnihotri, M. C. Yildiz, S. Ono, C.-K. Koh, and P. H. Madden. Recursive bisection based mixed block placement. In Proc. Int. Symp. on Physical Design, pages 84-89, 2004.
13. S. Kirkpatrick, C. D. Gelatt, and M. P. Veechi. Optimization by simulated annealing. Science, 220(4598):671-680, May 1983.
14. J. Kleinhans, G. Sigl, F. Johannes, and K. Antreich. GORDIAN: VLSI placement by quadratic programming and slicing optimization. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 10(3):356-365, 1991.
15. C. Li and C.-K. Koh. On improving recursive bipartitioning-based placement. Technical Report TR-ECE-03-14. Purdue University ECE. 2003.
16. C. Li, C.-K. Koh, and P. H. Madden. Routability-driven placement and white space allocation. In Proc. Int. Conf. on Computer Aided Design, pages 394-401, 2004.
17. C. Li, C.-K. Koh, and P. H. Madden. Floorplan management: Incremental placement for gate sizing and buffer insertion. In Proc. Asia South Pacific Design Automation Conf., pages 349-354, 2005.
18. P. H. Madden. Partitioning by iterative deletion. In Proc. Int. Symp. on Physical Design, pages 83-89, 1999.
19. S. Ono and P. H. Madden. On structure and suboptimality in placement. In Proc. Asia South Pacific Design Automation Conf., pages 331-336, 2005.
20. C. E. Radke. A justification of. and an improvement on. a useful rule for predicting circuit-to-pin ratios. In Proc. Design Automation Conf. Pages 257-267. 1969.
21. P. Ramachandran, A. R. Agnihotri, S. Ono, P. Damodaran, H. Srihari, and P. H. Madden. Optimal placement by branch-and-price. In Proc. Asia South Pacific Design Automation Conf., pages 337-341, 2005.
22. C. Scchen and A. Sangiovamii-Vincentelli. Timberwolf3.2: A new standard cell placement and global routing package. In Proc. Design Automation Conf. pages 432-439, 1986.
23. P. R. Suaris and G. Kedem. An algorithm for quadrisection and its application to standard cell placement. IEEE Trans. on Circuits and Systems, 35(3):394-303, 1988.
24. N. Viswanathan and C. C.-N. Chu. Fastplace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model. In Proc. Int. Symp. on Physical Design, pages 26-33, 2004.
25. J. Vygen. Algorithms for large-scale flatplacement. In Proc. Design Automation Conf, pages 746-751, 1997.
26. M. Wang, X. Yang, and M. Sarrafzadeh. Dragon2000: Standard-cell placement tool for large industry circuits. In Proc. Int. Conf. on Computer Aided Design, pages 260-263, 2000.
27. M. C. Yildiz and P. H. Madden. Global objectives for standard cell placement. In Proc. Great Lakes Symposium on VLSI, pages 68-72, 2001.
28. M. C. Yildiz and P. H. Madden. Improved cut sequences for partitioning based placement. In Proc. Design Automation Conf, pages 776-779, 2001.