SSTT: Efficient Local Search for GSI Global Routing

Journal of Computer Science and Technology

Volumn 18, Issue 5, 2003, Pages 632-639

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

^a TSINGHUA UNIVERSITY   (China)

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

Author keywords

Global routing; GSI (giga scale integrated circuits); Layout; Local search; SSTT (search space traversing technology)

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GLOBAL OPTIMIZATION; ROUTERS; TREES (MATHEMATICS);

LOCAL SEARCH;

INTEGRATED CIRCUITS;

EID: 0141867820     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02947123     Document Type: Article

References (24)

1. Hong X L, Yan X L, Qiao C G. Theories and Algorithms for VLSI Layout Design. Science Press, 1998.
2. Parkhurst J, Sherwani N, Maturi S et al. SRC physical design top ten problems. In Proc, ACM International Symposium on Physical Design, Monterey, CA, USA, 1999, pp.55-58.
3. Jing T, Hong X L, Cai Y C et al. The key technologies and related research work of performance-driven global routing. J. of Software, 2001, 12(5): 677-688.
4. Ting B S, Tien B N. Routing techniques for gate array, IEEE Trans. CAD, 1983, 2(4): 301-312.
5. Chiang C, Sarrafzadeh M, Wong C K. Global routing based on Steiner Min-Max trees. IEEE Trans. CAD, 1990, 9(12): 1318-1325.
6. Chiang C, Sarrafzadeh M, Wong C K. A powerful global router: Based on Steiner Min-Max trees. In Proc. IEEE/ACM International Conference on Computer-Aided Design, Santa Clara, CA, USA, 1989, pp.2-5.
7. Shragowitz E, Keel S. A global router based on a multi-commodity flow model. Integration, the VLSI J., 1987, 5: 3-16.
8. Meixner G, Lauther U. A new global router based on a flow model and linear assignment. In Proc. IEEE/ACM International Conference on Computer-Aided Design, Santa Clara, CA, USA, 1990, pp.44-47.
9. Vecchi M P, Kirkpatrick S. Global wiring by simulated annealing. IEEE Trans. CAD, 1983, 2(2): 215-222.
10. Sechen C, Sangiovanni-Vincentelli A. The TimberWolf placement and routing package. IEEE J. SSC, 1985, 20(2): 432-439.
11. Kirkpatrick S, Jr. Gelatt C D, Vecchi M P. Optimization by simulated annealing. Science, 1983, 220(4598): 671-680.
12. Moosa Z, Brown M, Edwards D. An application of simulated annealing to maze routing. In Proc, IEEE European Design Automation Conference, Grenoble, France, 1994, pp.211-216.
13. Aarts E H L, Laarhoven P J M V. Statistical cooling: A general approach to combinatorial optimization problems. Philips J. Research, 1985, 40: 193-226.
14. Lundy M. Convergence of an annealing algorithm. Math Program, 1986, 34: 111-124.
15. Carden IV R C. Microelectronics global routing and feasibility estimation using a multicommodity flow approach [Dissertation]. San Diego, CA, USA, University of California, 1991.
16. Carden IV R C, Cheng C K. A global router using an efficient approximate multicommodity multiterminal flow algorithm. In Proc. ACM/IEEE Design Automation Conference, San Francisco, CA, USA, 1991, pp.316-321.
17. Carden IV R C, Li J M, Cheng C K. A global router with a theoretical bound on the optimal solution. IEEE Trans. CAD, 1996, 15(2): 208-216.
18. Huang J, Hong X L, Cheng C K et al. An efficient timing-driven global routing algorithm. In Proc. ACM/IEEE Design Automation Conference, Dallas, TX, USA, 1993, pp.596-600.
19. 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.
20. 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.
21. Sarrafzadeh M, Wong C K. An Introduction to VLSI Physical Design. McGraw Hill, USA, 1996.
22. Garey M R, Johnson D S. The rectilinear Steiner problem is NP-complete. SIAM J. on Appl. Math., 1977, 32(4): 826-834.
23. Gu J, Huang X F. Efficient local search with search space smoothing: A case study of the traveling salesman problem (TSP). IEEE Trans. Systems, Man, and Cybernetics, 1994, 24(5): 728-735.
24. Bao H Y, Hong X L, Cai Y C et al. A hierarchical Steiner tree algorithm based on Dreyfus-Wagner method. Microelectronics & Computer, 1998, Ext. Iss: 41-44.