Retiming-based timing analysis with an application to mincut-based global placement

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 23, Issue 12, 2004, Pages 1684-1692

  Cong, Jason ^a   Lim, Sung Kyu ^b  

^a University of California   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Global placement; Retiming based timing analysis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FREQUENCIES; INFORMATION RETRIEVAL; OPTIMIZATION; TIME SERIES ANALYSIS;

FLOORPLANNING; GLOBAL PLACEMENT; RETIMING-BASED TIMING ANALYSIS; STATE-OF-THE ART METHODS;

COMPUTER AIDED DESIGN;

EID: 10044268437     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2004.837718     Document Type: Article

References (29)

1. J. Cong, L. He, C. K. Koh, and P. H. Madden, "Performance optimization of VLSI interconnect layout," Integration, VLSI J., pp. 1-94, 1996.
2. C. J. Alpert, T. F. Chan, A. B. Kahng, I. L. Markov, and P. Mulet, "Faster minimization of linear wirelength for global placement," IEEE Trans. Computer-Aided Design, vol. 17, pp. 3-13, Jan. 1998.
3. M. A. Breuer, "Class of min-cut placement algorithms," in Proc. ACM Design Automation Conf., 1997, pp. 284-290.
4. J. M. Kleinhans, G. Sigl, F. M. Johannes, and K. J. Antreich, "GORDIAN: VLSI placement by quadratic programming and slicing optimization," IEEE Trans. Computer-Aided Design, vol. 10, pp. 356-365, Mar. 1991.
5. H. Eisenmann and F. M. Johannes, "Generic global placement and floor-planning," in Proc. ACM Design Automation Conf., 1998, pp. 269-274.
6. W. J. Sun and C. Sechen, "Efficient and effective placement for very large circuits," IEEE Trans. Computer-Aided Design, vol. 14, pp. 349-359, Mar. 1995.
7. S. Hur and J. Lills, "Mongrel: Hybrid techniques for standard cell placement," in Proc. IEEE Int. Conf. Computer-Aided Design, 2000, pp. 165-170.
8. M. Wang, X. Yang, and M. Sarrafzadeh, "Dragon 2000: Fast standard-cell placement for large circuits," in Proc. IEEE Int. Conf Computer-Aided Design, 2000, pp. 260-263.
9. M. C. Yildiz and P. H. Madden, "Improved cut sequences for partitioning based placement," in Proc. ACM Design Automation Conf., 2001, pp. 776-779.
10. J. Cong, "An interconnect-centric design flow for nanometer technologies," in Proc. Int. Symp. VLSI Technol., Syst., Applicat., 1999, pp. 54-57.
11. E. L. Lawler, K. N. Levitt, and J. Turner, "Module clustering to minimize delay in digital networks," IEEE Trans. Computer-Aided Design, vol. C-18, no. 1, pp. 47-57, 1966.
12. R. Murgai, R. K. Brayton, and A. S. Vincentelli, "On clustering for minimum delay/area," in Proc. IEEE Int. Conf Computer-Aided Design, 1991, pp. 6-9.
13. R. Rajaraman and D. F. Wong, "Optimal clustering for delay minimization," in Proc. ACM Design Automation Conf., 1993, pp. 309-314.
14. P. Pan, A. K. Karandikar, and C. L. Liu, "Optimal clock period clustering for sequential circuits with retiming," IEEE Trans. Computer-Aided Design, vol. 17, pp. 489-498, June 1998.
15. J. Cong, H. Li, and C. Wu, "Simultaneous circuit partitioning/clustering with retiming for performance optimization," in Proc. ACM Design Automation Conf., 1999, pp. 460-465.
16. J. Cong, S. K. Lim, and C. Wu, "Performance driven multi-level and multiway partitioning with retiming," in Proc. ACM Design Automation Conf., 2000, pp. 274-279.
17. C. E. Leiserson and J. B. Saxe, "Retiming synchronous circuitry," Algorithmica, pp. 5-35, 1991.
18. A. Ranjan, A. Srivastava, V. Karnam, and M. Sarrafzadeh, "Layout aware retiming," in Proc. Great Lakes Symp. VLSI, 2001, pp. 25-30.
19. I. Neumann and W. Kunz, "Layout driven retiming using the coupled edge timing model," IEEE Trans. Computer-Aided Design, vol. 22, pp. 825-835, July 2003.
20. J. Cong and D. Z. Pan, "Interconnect delay estimation models for synthesis and design planning," in Proc. Asia South Pacific Design Automation Conf., 1999, pp. 97-100.
21. R. Bellman, "On a routing problem," Quart. Appl. Math., vol. 6, pp. 87-90, 1958.
22. C. Fiduccia and R. Mattheyses, "A linear time heuristic for improving network partitions," in Proc. ACM Design Automation Conf., 1982, pp. 175-181.
23. J. Cong and S. K. Lim, "Edge separability based circuit clustering with application to circuit partitioning," in Proc. Asia South Pacific Design Automation Conf., 2000, pp. 429-434.
24. _, "Multiway partitioning with pairwise movement," in Proc. IEEE Int. Conf Computer-Aided Design, 1998, pp. 512-516.
25. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, "Multilevel hypergraph partitioning: Application in VLSI domain," in Proc. ACM Design Automation Conf., 1997, pp. 526-529.
26. ITC 1999 Benchmark Suite [Online]. Available: http://www.cad.polito.it/tools/9.html
27. ISCAS 1989 Benchmark Suite [Online]. Available: http://www.cbl.ncsu.edu
28. D. F. Wong and C. L. Liu, "Floorplan design of VLSI circuits," Algorithmica, pp. 263-291, 1989.
29. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani, "Rectangle packing based module placement," in Proc. IEEE Int. Conf. Computer-Aided Design, 1995, pp. 472-479.