CNB: A critical-network-based timing optimization method for standard cell global routing

Journal of Computer Science and Technology

Volumn 18, Issue 6, 2003, Pages 732-738

  Hong, XianLong ^a   Jing, Tong ^a   Xu, JingYu ^a   Bao, HaiYun ^a   Gu, Jun ^b  

^a TSINGHUA UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Critical network based (CNB); Global routing; Layout; Standard cell (SC); Timing optimization

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); CONGESTION CONTROL (COMMUNICATION); LOGIC CIRCUITS; OPTIMIZATION; TELECOMMUNICATION TRAFFIC;

CRITICAL-NETWORK-BASED TIMING OPTIMIZATION METHOD; STANDARD CELL GLOBAL ROUTING;

INTERCONNECTION NETWORKS;

EID: 0346335498     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02945461     Document Type: Letter

References (26)

1. Jing T, Hong X L, Cai Y C et al. The key technologies and related research work of performance-driven global routing. J. Software, 2001, 12(5): 677-688.
2. Jing T, Hong X L, Cai Y C et al. Challenges to datapath physical design inside SOC. Chinese Journal of Semiconductors. 2002, 23(8): 785-793.
3. Elmore W C. The transient response of lumped linear networks with particular regard to wideband amplifiers. Journal of Applied Physics, 1948, 19(1): 55-59.
4. Chen C P, Chen Y P, Wong D F. Optimal wiresizing formula under the Elmore delay model. In Proc. ACM/IEEE DAC, Las Vegas, Nevada, 1996, Session 26.4.
5. Sacurai T. Approximation of wiring delay in MOSFET LSI. IEEE Journal of Solid-State Circuits, 1983, 18(4): 418-426.
6. Yin L, He L. An efficient analytical model of coupled on-chip RLC interconnections. In Proc. IEEE/ACM ASP-DAC, Yokohama, Japan, 2001, pp.385-390.
7. Hong X L, Xue T X, Cheng C K et al. Performance-driven Steiner tree algorithm for global routing. In Proc. ACM/IEEE DAC, Dallas, Texas, 1993, pp. 177-181.
8. Bao H Y, Hong X L, Cai Y C. Timing-driven Steiner tree algorithm based on Sakurai model. Chinese J. Semiconductors, 1999, 20(1): 41-46.
9. Xu J Y, Hong X L, Jing T et al. An efficient hierarchical timing-driven Steiner tree algorithm for global routing. In Proc. IEEE/ACM ASP-DAC, Bangalore, India, 2002, pp. 473-478.
10. Cong J, Leung K S. Optimal wiresizing under Elmore delay model. IEEE Trans. CAD, 1995, 14(3): 321-336.
11. Cong J, He L. Optimal wiresizing for interconnects with multiple sources. ACM Trans. Design Automation of Electronic Systems, 1996, 1(4): 478-511.
12. Cong J, He L, Cheng K K et al. Interconnect design for deep submicron ICs. In Proc. IEEE/ACM ICCAD, Los Alamitos, 1997.
13. Chris C N Chu, D F Wong. An efficient and optimal algorithm for simultaneous buffer and wire sizing. IEEE Trans. CAD, 1999, 18(9): 1297-1304.
14. Lillis J, Cheng C K. Timing optimization for multisource nets: Characterization and optimal repeater insertion. IEEE Trans. CAD, 1999, 18(3): 322-331.
15. Alpert C J, Hrkic M, Hu J et al. Buffered Steiner tree for difficult instances. In Proc. ACM ISPD, 2001, pp.4-9.
16. Swartz W, Sechen C. Timing driven placement for large standard cell circuits. In Proc. ACM/IEEE DAC, 1995, pp.211-215.
17. Jackson M, Kuh E S. Performance-driven placement of cell based IC's. In Proc. ACM/IEEE DAC, 1989, pp.370-375.
18. Hu J, Sapatnekar S S. A timing-constrained algorithm for simultaneous global routing of multiple nets. In Proc. IEEE/ACM ICCAD, 2000, pp.99-103.
19. Huang J, Hong X L, Cheng C K et al. An efficient timing-driven global routing algorithm. In Proc. ACM/IEEE DAC, Dallas, TX, U.S.A., 1993, pp.596-600.
20. Fujihara Y, Sekiyama Y et al. DYNAJUST: An efficient automation routing technique optimizing delay conditions. In Proc. ACM/IEEE DAC, 1989, pp.791-794.
21. Jackson M A B, Kuh E S, Marek-Sadowska M. Timing driven routing for building block layout. In Proc. IEEE ISCAS, 1987, pp.518-519.
22. Dunlop A E, Agrawal V D et al. Chip layout optimization using critical path weighting. In Proc. ACM/IEEE DAC, 1984, pp. 133-136.
23. Rose M, Wiesel M, Kirkpatrick D, Nettleton N. Dense, performance directed, auto place and route. In Proc. CICC, 1988, pp. 11.1.1-11.1.4.
24. Hong X L, Xue T X, Huang J et al. TIGER: An efficient timing-driven global routing algorithm for standard cell and gate array design. IEEE Trans. CAD, 1997, 16(11): 1323-1331.
25. Bao H Y, Jing T, Hong X L et al. A novel random global routing algorithm independent of net ordering. Chinese J. Computers, 2001, 24(6): 574-579.
26. Jing T, Hong X L, Bao H Y et al. SSTT: Efficient local search for GSI global routing. J. Computer Science and Technology, 2003, 18(5): 632-639.