Global and Detailed Routing

Electronic Design Automation

Volumn , Issue , 2009, Pages 687-749

  Chen, Huang Yu ^a   Chang, Yao Wen ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84882811471     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-0-12-374364-0.50019-9     Document Type: Chapter

References (81)

1. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, W. H. Freeman & Co., New York.
2. Ho T.-Y., Chang Y.-W., Chen S.-J. Full-Chip Nanometer Routing Techniques 2007, Springer, Dordrecht, The Netherlands.
3. Preparata F.P., Shamos M.I. Computational Geometry: An Introduction 1985, Springer-Verlag, New York,.
4. Sait S.M., Youssef H. VLSI Physical Design Automation: Theory and Practice 1999, World Scientific, Singapore.
5. Saxena P., Shelar R.S., Sapatnekar S.S. Routing Congestion in VLSI Circuits: Estimation and Optimization 2007, Springer, New York.
6. Chen T.-C., Chang Y.-W. Multilevel full-chip gridless routing with applications to optical proximity correction. IEEE Trans. on Computer-Aided Design June 2007, 26(6):1041-1053.
7. Cong J., Fang J., Khoo K.-Y. An implicit connection graph maze routing algorithm for eco routing. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2005, 163-167.
8. Qusterhout J.K. Corner stitching: A data structuring technique for VLSI layout tools. IEEE Trans. on Computer-Aided Design January 1984, 3(1):87-100.
9. Zheng S.Q., Lim J.S., Iyengar S.S. Finding obstacle avoiding shortest paths using implicit connection graphs. IEEE Trans. on Computer-Aided Design January 1996, 15(1):103-110.
10. Akers S.B. A modification of Lee's path connection algorithm. IEEE Trans. on Electronic Computers February 1967, 16(1):97-98.
11. Clow G.W. A global routing algorithm for general cells. Proc. ACM/IEEE Design Automation Conf. June 1984, 45-51.
12. Hadlock F.O. A shortest path algorithm for grid graphs. Networks Winter, 1977, 7(4):323-334.
13. Hart P.E., Nilsson N.J., Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on Systems Science and Cybernetics July 1968, 4(2):100-107.
14. Hightower D. A solution to line routing problems on the continuous plane. Proc. ACM/IEEE Design Automation Conf. June 1969, 1-24.
15. Lee C.Y. An algorithm for path connection and its application. IRE Trans. on Electronic Computer 1961, 10:346-365.
16. McMurchie L., Ebeling C. PathFinder: A negotiation-based performance-driven router for FPGAs. Proc. Int. ACM Symp. on Field-Programmable Gate Arrays February 1995, 111-117.
17. Mikami K., Tabuchi K. A computer program for optimal routing of printed circuit connectors. Proc. Int. Federation for Information Processing November 1968, 1475-1478.
18. Soukup J. Fast maze router. Proc. ACM/IEEE Design Automation Conf. June 1978, 100-102.
19. Abel L.C. On the ordering of connections for automatic wire routing. IEEE Trans. on Computers November 1972, 21(11):1227-1233.
20. Chang Y.-J., Lee Y.-T., Wang T.-C. NTHU-Route 2.0: A Fast and Stable Global Router. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2008, 338-343.
21. Chen H.-M., Zhou H., Young F.Y., Wong D.F., Yang H.H., Sherwani N. Integrated floorplanning and interconnect planning. Proc. IEEE/ACM Int. Conf. on computer-Aided Design November 1999, 354-357.
22. Cho M., Lu K., Yuan K., Pan D.Z. BoxRouter 2.0: Architecture and implementation of a hybrid and robust global router. Proc. ACM/IEEE Design Automation Conf. June 2007, 503-508.
23. Cho M., Pan D.Z., Xiang H., Puri R. Wire density driven global routing for CMP variation and timing. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2006, 487-492.
24. Chu C. FLUTE: fast lookup table based wirelength estimation technique. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2004, 696-701.
25. Garey M.R., Johnson D.S. The rectilinear Steiner tree problem is NP-complete. SIAM Journal Applied Mathematics June 1977, 32(4):826-834.
26. Hanan M. On Steiner's problem with rectilinear distance. SIAM Journal on Applied Mathematics March 1966, 14(2):255-265.
27. Ho J.-M., Vijayan C.K., Wong C.K. New algorithms for the rectilinear Steiner tree problem. IEEE Trans. on Computer-Aided Design February 1990, 9(2):185-193.
28. Hsu C.-H., Chen H.-Y., Chang Y.-W. Multi-layer global routing considering via and wire capacities. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2008, 350-355.
29. Hwang F.K. On Steiner minimal tree with rectilinear distance. SIAM Journal on Applied Mathematics January 1976, 30(1):104-114.
30. Kahng A.B., Robins G. A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 1990, 428-431.
31. Kastner R., Bozorgzadeh E., Sarrafzadeh M. Pattern routing: use and theory for increasing predictability and avoiding coupling. IEEE Trans. on Computer-Aided Design November 2002, 21(7):777-790.
32. Kruskal J.B. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. the American Mathematical Society February 1956, 7(1):48-50.
33. Lin C.-W., Chen S.-Y., Li C.-F., Chang Y.-W., Yang C.-L. Obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE Trans. Computer-Aided Design April 2008, 27(4):643-653.
34. Lin C.-W., Huang S.-L., Hsu K.-C., Lee M.-X., Chang Y.-W. Efficient multi-layer obstacle-avoiding rectilinear Steiner tree construction. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2007, 380-385.
35. McMurchie L., Ebeling C. PathFinder: A negotiation-based performance-driven router for FPGAs. Proc. Int. ACM Symp. on Field-Programmable Gate Arrays February 1995, 111-117.
36. Pan M., Chu C.N. FastRoute 2.0: A high-quality and efficient global router. Proc. IEEE/ACM Asian and South Pacific Design Automation Conf. January 2007, 250-255.
37. Prim R.C. Shortest connection networks and some generalizations. Bell System Technical Journal 1957, 36:1389-1401.
38. Raghavan P., Thompson C.D. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Proc. Combinatorica December 1987, 365-374.
39. Roy J.A., Markov I.L. High-performance routing at the nanometer scale. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2007, 496-502.
40. Shi Y., Jing T., He L., Feng Z., Hong X. CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model. Proc. IEEE/ACM Asia and South Pacific Design Automation Conf. January 2006, 630-635.
41. Zhou H. Efficient Steiner tree construction based on spanning graphs. IEEE Trans. on Computer-Aided Design May 2004, 23(5):704-710.
42. Burstein M., Pelavin R. Hierarchical wire routing. IEEE Trans. on Computer-Aided Design October 1983, 2(4):223-234.
43. Chang Y.-W., Lin S.-P. MR: A new framework for multilevel full-chip routing. IEEE Trans. on Computer-Aided Design May 2004, 23(5):793-800.
44. Cong J., Fang J., Zhang Y. Multilevel approach to full-chip gridless routing. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2001, 396-403.
45. Cong J., Xie M., Zhang Y. An enhanced multilevel routing system. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2002, 51-58.
46. Deutsch D.N. A "dogleg" channel router. Proc. ACM/IEEE Design Automation Conf. June 1976, 425-433.
47. Hashimoto A., Stevens J. Wire routing by optimizing channel assignment within large apertures. Proc. ACM/IEEE Design Automation Conf. June 1971, 155-169.
48. Lin S.-P., Chang Y.-W. A novel framework for multilevel routing considering routability and performance. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2002, 44-50.
49. Lin Y.-L., Hsu Y.-C., Tsai F.-S. Hybrid routing. IEEE Trans. on Computer-Aided Design February 1990, 9(2):151-157.
50. Marek-Sadowska M. Global router for gate array. Proc. IEEE Int. Conf. on Computer Design October 1984, 332-337.
51. Szymanski T.G. Dogleg channel routing is NP-complete. IEEE Trans. on Computer-Aided Design January 1985, 4(1):31-41.
52. Chaudhary K., Onozawa A., Kuh E.S. A spacing algorithm for performance and crosstalk reduction. Proc. IEEE Int. Conf. on Computer-Aided Design November 1993, 697-702.
53. Chen H.-Y., Chiang M.-F., Chang Y.-W., Chen L., Han B. Full-chip routing considering double-via insertion. IEEE Trans. on Computer-Aided Design May 2008, 27(5):844-857.
54. Chen T.-C., Chang Y.-W. Multilevel full-chip gridless routing with applications to optical proximity correction. IEEE Trans. on Computer-Aided Design June 2007, 26(6):1041-1053.
55. Chen H.-Y., Chou S.-J., Wang S.-L., Chang Y.-W. Novel wire density driven full-chip routing for CMP variation control. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2007, 831-838.
56. Chen T.-C., Liao G.-W., Chang Y.-W. Predictive formulae for OPC with applications to lithography-friendly routing. Proc. ACM/IEEE Design Automation Conf. June 2008, 510-515.
57. Chen P.H., Malkani S., Peng C.-M., Lin J. Fixing antenna problem by dynamic diode dropping and jumper insertion. Proc. IEEE Int. Symp. on Quality Electronic Design March 2000, 275-282.
58. Cho M., Pan D.Z., Xiang H., Puri R. Wire density driven global routing for CMP variation and timing. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2006, 487-492.
59. Cong J., Pan D.Z., Srinivas P.V. Improved crosstalk modeling for noise constrained interconnect optimization. Proc. IEEE/ACM Asia and South Pacific Design Automation Conf. January 2001, 373-378.
60. Gao T., Liu C.-L. Minimum crosstalk channel routing. IEEE Trans. on Computer-Aided Design May 1996, 15(5):465-474.
61. Ho T.-Y., Chang Y.-W., Chen S.-J. Multilevel routing with antenna avoidance. Proc. ACM Int. Symp. on Physical Design April 2004, 34-40.
62. Ho T.-Y., Chang Y.-W., Chen S.-J., Lee D.-T. Crosstalk- and performance-driven multilevel full-chip routing. IEEE Trans. on Computer-Aided Design June 2005, 24(6):869-878.
63. Huang L.-D., Tang X., Xiang H., Wong D.F., Liu I.-M. A polynomial time-optimal diode insertion/routing algorithm for fixing antenna problem. IEEE Trans. on Computer-Aided Design January 2004, 23(1):141-147.
64. Huang L.-D., Wong D.F. Optical proximity correction (OPQ-friendly maze routing. Proc. ACM/IEEE Design Automation Conf. June 2004, 186-191.
65. Jiang Z.-W., Chang Y.-W. An optimal network-flow-based simultaneous diode and jumper insertion algorithm for antenna fixing. IEEE Trans. on Computer-Aided Design June 2008, 27(6):1055-1065.
66. Jiang I.H.-R., Chang Y.-W., Jou J.-Y. Crosstalk-driven interconnect optimization by simultaneous gate and wire sizing. IEEE Trans. on Computer-Aided Design September 2000, 19(9):999-1010.
67. Lee K.-Y., Koh C.-K., Wang T.-C., Chao K.-Y. Optimal post-routing redundant via insertion. Proc. ACM Int. Symp. on Physical Design April 2008, 111-117.
68. Lee K.-Y., Wang T.-C. Post-routing redundant via insertion for yield/reliability improvement. Proc. ACM/IEEE Asia and South Pacific Design Automation Conf. January 2006, 303-308.
69. Li K.S.-M., Lee C.-L., Chang Y.-W., Su C.-C., Chen J.E. Multilevel full-chip routing with testability and yield enhancement. IEEE Trans. on Computer-Aided Design September 2007, 26(9):1625-1636.
70. Luo J., Su Q., Chiang C., Kawa J. A layout dependent full-chip copper electroplating topography model. Proc. IEEE/ACM Int. Conf. on Computer-Aided Design November 2005, 133-140.
71. Sakurai T., Tamaru K. Simple formulas for two and three dimensional capacitance. IEEE Trans. on Electronic Devices February 1983, 30(2):183-185.
72. Su B.-Y., Chang Y.-W., Hu J. An optimal jumper insertion algorithm for antenna avoidance/fixing. IEEE Trans. on Computer-Aided Design October 2007, 26(10):1818-1929.
73. Tian R., Wong D.F., Boone R. Model-based dummy feature placement for oxide chemical-mechanical polishing manufacturability. Proc. ACM/IEEE Design Automation Conf. June 2000, 667-670.
74. Vittal A., Chen L.H., Marek-Sadowska M., Wang K.-P., Yang S. Crosstalk in VLSI interconnections. IEEE Trans. on Computer-Aided Design December 1999, 18(12):1817-1824.
75. D. White and B. Moore, An 'intelligent' approach to dummy fill, in EE Times, January 3, 2005.
76. Wu D., Hu J., Mahapatra R. Coupling aware tuning optimization and antenna avoidance in layer assignment. Proc. ACM. Int. Symp. on Physical Design April 2005, 20-27.
77. Wu Y.-R., Tsai M.-C., Wang T.-C. Maze routing with OPC consideration. Proc. ACM/IEEE Asia and South Pacific Design Automation Conf. January 2005, 198-203.
78. Xu G., Huang L.-D., Pan D.Z., Wong F.D. Redundant-via enhanced maze routing for yield improvement. Proc. ACM/IEEE Asia and South Pacific Design Automation Conf. January 2005, 1148-1151.
79. Yao H., Cai Y., Hong X., Zhou Q. Improved multilevel routing with redundant via placement for yield and reliability. Proc. ACM Great Lakes Symp. on VLSI April 2005, 143-146.
80. Zhou H., Wong D.F. Global routing with crosstalk constraints. Proc. ACM/IEEE Design Automation Conf. June 1998, 374-377.
81. Nam G.-J., Yildiz M., Pan D.Z., Madden P.H. ISPD placement contest updates and ISPD 2007 global routing contest. Proc. ACM Int. Symp. on Physical Design April 2007, 167.