Hippocrates: First-do-no-harm detailed placement

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2007, Pages 141-146

  Ren, Haoxing ^a   Pant, David Z ^b   Alpert, Charles J ^a   Nam, Gi Joon ^a   Villarrubia, Paul ^a  

^a IBM   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN AUTOMATION CONFERENCE (DAC); ENGINEERING CHANGE ORDERS (ECO); EXPERIMENTAL RESULTS; HIPPOCRATES; MAXIMUM OUTPUT; PHYSICAL SYNTHESIS; ROUTING CONGESTION; SOUTH PACIFIC; TIMING CHARACTERISTICS; TIMING CONSTRAINTS; TOTAL WIRE LENGTH; WIRE LENGTHS;

CODES (SYMBOLS); COMPUTER AIDED DESIGN; DIGITAL INTEGRATED CIRCUITS; GLOBAL OPTIMIZATION; INDUSTRIAL ENGINEERING; KETONES; LEAD; MECHANIZATION; OPTIMIZATION; TIMING CIRCUITS;

TIME MEASUREMENT;

EID: 43349097217     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2007.357976     Document Type: Conference Paper

References (24)

1. A. B. Kahng and Q. Wang, "Implementation and extensibility of an analytic placer," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, pp. 734-747, 2005.
2. T. Chan, J. Cong, and K. Sze, "Multilevel generalized force-directed method for circuit placement," in Proc. Int. Symp. on Physical Design, pp. 185-192, 2005.
3. B. Hu and M. Marek-Sadowska, "Far: Fixed-points and relaxation based placement," in Proc. Int. Symp. on Physical Design, pp. 161-166, 2002.
4. H. Eisenmann and F. M. Johannes, "Generic global placement and floorplanning," in Proc. Design Automation Conf, pp. 269-274, 1998.
5. A. E. Caldwell, A. B. Kahng, and I. L.Markov, "Can recursive bisection alone produce routable, placements?," in Proc. Design Automation Conf., pp. 477-482, 2000.
6. M. Wang, X. Yang, and M. Sarrafzadeh, "Dragon2000: Standard-cell placement tool for large industry circuits," in Proc. Int. Conf. on Computer Aided Design, pp. 260-263, 2000.
7. C. Sechen and A. Sangiovanni-Vincentelli, "The timberwolf placement and routing package," IEEE J. Solid-State Circuits, vol. 20, pp. 510-522, 1985.
8. W. Donath, P. Kudva, L. Stok, P. Villarrubia, L. Reddy, A. Sullivan, and K. Chakraborty, "Transformational placement and synthesis," in Proc. Design, Automation and Test in Eurpoe, Mar. 2000.
9. L. P. P. P. van Ginneken, "Buffer placement in distributed RC-tree networks for minimal Elmore delay," in Proc. IEEE Int. Symp. on Circuits and Systems, pp. 865-868, May 1990.
10. M. Berkelaar and J. Jess, "Gate sizing in MOS digital circuits with linear programming," in Proc. European Design Automation Conf., pp. 217-221, June 1990.
11. U. Brenner, A. Pauli, and J. Vygen, "Almost optimum placement legalization by minimum cost flow and dynamic programming," in Proc. Int. Symp. on Physical Design, pp. 2-9, 2004.
12. S. W. Hur and J. Lilis, "Mongrel: hybrid techniques for standard cell placement," in Proc. Int. Conf. on Computer Aided Design, pp. 165-170, 2000.
13. 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, pp. 307-310, 2003.
14. A. B. Kahng, I. L. Markov, and S. Reda, "On legalization of row-based placements," in Proceedings 14th Great Lakes Symposium on VLSI, pp. 214-219, 2004.
15. H. Ren, D. Z. Pan, C. J. Alpert, and P. Villarrubia, "Diffusion- based placement migration," in Proc. Design Automation Conf., pp. 515-520, 2005.
16. L. Tao, H. Ren, C. Alpert, and D. Z. Pan, "Computational geometry based placement migration," in Proc. Int. Conf. on Computer Aided Design, pp. 41-47, 2005.
17. A. H. Ajami and M. Pedram, "Post-layout timing driven cell placement using an accurate net length model," in Proc. Design Automation Conf., pp. 595-600, 2001.
18. W. Choi and K. Bazargan, "Incremental placement for timing optimization," in Proc. Int. Conf. on Computer Aided Design, pp. 463-466, 2003.
19. A. Chowdhary, K. Rajagopal, S. Venkatesan, T. Cao, V. Tiourin, Y Parasuram, and B. Halpin, "How accurately can we model timing in a placement engine," in Proc. Design Automation Conf., pp. 801-806, 2005.
20. P. Ramachandaran, A. R. Agnihotri, S. Ono, P. Damodaran, K. Srihari, and P. H. Madden, "Optimal placement by branch-and-price," in Proc. Asia and South Pacific Design Automation Conf, pp. 337-342, Jan. 2005.
21. O. Faroe, D. Pisinger, and M. Zachariasen, "Local search for final placement in vlsi design," in Proc. Int. Conf. on Computer Aided Design, pp. 565-572, 2001.
22. M. Pan, N. Viswanathan, and C. Chu, "An efficient and effective detailed placement algorithm," in Proc. Int. Conf. on Computer Aided Design, pp. 48-55, 2005.
23. B. Halpin, N. Sehgal, and C. Y. R. Chen, "Detailed placement with net length constraints," in Proc. of The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, pp. 22-27, 2003.
24. H. Ren, D. Z. Pan, and D. Kung, "Sensitivity guided net weighting for placement driven synthesis," in Proc. Int. Symp. on Physical Design, pp. 10-17, 2004.