A survey on multi-net global routing for integrated circuits

Integration, the VLSI Journal

Volumn 31, Issue 1, 2001, Pages 1-49

  Hu, Jiang ^a   Sapatnekar, Sachin S ^b  

^a IBM MICROELECTRONICS   (United States)

^b University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); CROSSTALK; OPTIMIZATION; ROUTERS; SEQUENTIAL CIRCUITS;

MULTI-NET ROUTING;

VLSI CIRCUITS;

EID: 0035513318     PISSN: 01679260     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9260(01)00020-7     Document Type: Review

References (93)

1. The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits
2. Global routing
3. Performance optimization of VLSI interconnect layout
4. An algorithm for path connection and its applications
5. A note on two problems in connection with graphs
6. A solution to line routing problems on the continuous plane
7. Global wiring on a wire routing machine
8. Timing driven maze routing
9. Timing-driven maze routing
10. Prim-dijkstra tradeoffs for improved performance-driven routing tree design
11. Provably good performance driven global routing
12. Near-optimal critical sink routing tree constructions
13. Interconnect layout optimization under higher-order RLC model
14. Performance driven interconnect design based on distributed RC delay model
15. Non-Hanan routing
16. Algorithms for non-Hanan-based optimization for VLSI interconnect under a higher order AWE model
17. New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing
18. Minimum delay interconnect design using alphabetic trees
19. Provably good global routing by a new approximation algorithm for multicommodity flow
20. A global router with a theoretical bound on the optimal solution
21. A new polynomial-time algorithm for linear programming
22. Randomized rounding: A technique for provably good algorithms and algorithmic proofs
23. An adaptation of the interior point method for solving the global routing problem
24. Theory and concepts of circuit layout
25. Hierarchical wire routing
26. The efficient solution of integer programs for hierarchical global routing
27. A decomposition algorithm for circuit routing
28. A hierarchical global wiring algorithm for custom chip design
29. A new global router using zero-one integer linear programming techniques for sea-of-gates and custom logic arrays
30. Four-bend top-down global routing
31. A timing-constrained algorithm for simultaneous global routing of multiple nets
32. A new global router based on a flow model and linear assignment
33. On the ordering of connections for automatic wire routing
34. A force-directed global router
35. Global routing based on Steiner min-max trees
36. A weighted Steiner tree-based global router with simultaneous length and density minimization
37. Global routing for gate array
38. Optimization by simulated annealing
39. Global wiring by simulated annealing
40. TimberWolf3.2: A new standard cell placement and global routing package
41. A new global router for ASIC design based on simulated evolution
42. A macro-cell global router based on two genetic algorithms
43. Timing-driven global routing for standard-cell VLSI design
44. Routing techniques for gate array
45. A simple yet effective technique for global wiring
46. A global router for sea-of-gate circuits
47. Multilayer chip-level global routing using an efficient graph-based Steiner tree heuristic
48. A multiple source algorithm for suboptimal steiner trees in graphs
49. A global router based on a multicommodity flow model
50. Multiterminal global routing: A deterministic approximation scheme
51. The maximum concurrent flow problem
52. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
53. A hybrid hierarchical approach for multi-layer global routing
54. A hierarchical global router for macro-block-embedded sea-of-gates
55. Top down hierarchical global routing for channelless gate arrays based on linear assignment
56. Hybrid routing
57. Global router for gate array
58. Route planner for custom chip design
59. A new approach to sea-of-gates global routing
60. Hierarchical VLSI routing - An approximate routing procedure
61. Hierarchical loose routing for gate arrays
62. A new algorithm for standard cell global routing
63. A new algorithm for standard cell global routing
64. Performance driven global routing for standard cell design
65. TIGER: An efficient timing-driven global router for gate array and standard cell layout design
66. An efficient timing-driven global routing algorithm
67. An efficient timing-driven global routing method for standard cell layout
68. Performance-driven interconnect global routing
69. Optimal wiresizing under the distributed Elmore delay model
70. Simultaneous driver and wire sizing for performance and power optimization
71. On Steiner's problem with rectilinear distance
72. Fast and simple approximation schemes for generalized flow
73. Global routing with crosstalk constraints
74. Global routing with crosstalk constraints
75. Post global routing crosstalk risk estimation and reduction
76. Challenges and opportunities for design innovations in nanometer technologies
77. Buffer block planning for interconnect-driven floorplanning
78. Provably good global buffering using an available buffer block plan
79. Routability-driven repeater block planning for interconnect-centric floorplanning
80. Planning buffer locations by network flows
81. A practical methodology for early buffer and wire resource allocation