## An ILP based hierarchical global routing approach for VLSI ASIC design (2007)

Citations: | 8 - 2 self |

### BibTeX

@MISC{Yang07anilp,

author = {Zhen Yang and Anthony Vannelli and Shawki Areibi},

title = { An ILP based hierarchical global routing approach for VLSI ASIC design},

year = {2007}

}

### OpenURL

### Abstract

The use of integrated circuits in high-performance computing, telecommunications, and consumer electronics has been growing at a very fast pace. The level of integration as measured by the number of logic gates in a chip has been steadily rising due to the rapid progress in processing and interconnect technology. The interconnect delay in VLSI circuits has become a critical determiner of circuit performance. As a result, circuit layout is starting to play a more important role in today’s chip designs. Global routing is one of the key sub-problems of circuit layout which involves finding an approximate path for the wires connecting the elements of the circuit without violating resource constraints. In this paper, several integer programming (ILP) based global routing models are fully investigated and explored. The resulting ILP problem is relaxed and solved as a linear programming (LP) problem followed by a rounding heuristic to obtain an integer solution. Experimental results obtained show that the proposed combined WVEM (wirelength, via, edge capacity) model can optimize several global routing objectives simultaneously and effectively. In addition, several hierarchical methods are combined with the proposed flat ILP based global router to reduce the CPU time by about 66 % on average for edge capacity model (ECM).

### Citations

927 |
Programming and Extensions
- Dantzig, Linear
- 1963
(Show Context)
Citation Context ...URE REVIEW 53 heuristic techniques. In [Hu85], Hu and Shing directly solve the linear relaxation version of the Integer Programming based global routing problem. They use column generation techniques =-=[Dant63]-=- to generate potential Steiner trees and select the Steiner tree with the highest fractional value as the final route of each net. Karp et al. [Karp87] introduce a global routing algorithm based on li... |

695 | A new polynomial-time algorithm for linear programming
- Karmarkar
- 1984
(Show Context)
Citation Context ...inear programming relaxation and randomized rounding, which is a technique discussed in detail by Raghavan and Thompson [Ng87, Ragh91]. In [Vann91], an adaptation of Karmarkar’s Interior Point Method =-=[Karm84]-=- is used to solve the linear relaxation formulation presented in [Hu85]. The experimental results indicate that the Interior Point Method runs much faster than an equivalent simplex implementation. In... |

620 |
Data Structures and Network Algorithms
- Tarjan
- 1983
(Show Context)
Citation Context ... of minimum Spanning tree (MST) to that of an optimal rectilinear Steiner tree is no greater than 3. A minimum spanning tree for a given net can 2sCHAPTER 2. BACKGROUND 25 be found in polynomial time =-=[Tarj83]-=-. Therefore, to produce a RSMT, a minimum spanning tree is first built for each net. Then, a near RSMT can be obtained by linearizing each edge of the minimum spanning tree. This linearizion is done b... |

445 |
Combinatorial algorithms for integrated circuit layout
- Lengauer
- 1990
(Show Context)
Citation Context ...CHAPTER 2. BACKGROUND 23 2.3.1 Problem Overview The global routing problem is typically presented as a graph problem, where the routing regions and the module connections are modeled using grid graph =-=[Leng90]-=-. Initially, a given chip is partitioned into a set of rectangular regions, called global bins. The cells are placed into these bins and each cell is assumed to be placed in the center of the global b... |

343 | Randomized rounding: A technique for provably good algorithms and algorithmic proofs - Raghavan, Thompson - 1987 |

243 |
Algorithm for VLSI Physical Design Automation
- Sherwani
- 1995
(Show Context)
Citation Context ...ental results. Finally, chapter 5 provides conclusions and directions of future work.sChapter 2 Background In the combinatorial sense, physical design automation is a constrained optimization problem =-=[Sher93a]-=-. We are given a circuit (usually a module-wire connection-list called a netlist) which is a description of switching elements and their connecting wires. We seek an assignment of X and Y coordinates ... |

212 |
An Algorithm for Path Connections and Its Applications
- Lee
- 1961
(Show Context)
Citation Context ...ypes: Maze routing algorithms (with variations) and Line-Probe Algorithms. In 1961, a maze routing algorithm for finding a shortest path between two points on a grid graph was first introduced by Lee =-=[Lee61]-=-. The searching in Lee’s algorithm is conducted by using the breath-first search technique (BFS). In order to find the shortest path between a source point “S” and a target “T”, the maze global router... |

205 |
The Rectilinear Steiner Tree Problem is NP-Complete
- Garey, Johnson
- 1977
(Show Context)
Citation Context ...le of 4-terminal net and its Hanan grid. The problem of finding Rectilin(a) 4−terminal net (b) Hanan grid Figure 2.8: Four-terminal net and its Hanan grid ear Steiner Minimum Trees (RSMTs) is NP-hard =-=[Gare77]-=-. Most of the heuristic algorithms take the minimum RSTs as an approximation for the RSMTs due to the special relationship between these two types of trees. In the case of a Steiner tree, a route can ... |

203 | Gordon: Vlsi Placement by quadratic programming and slicing optimization - KLEINHANS, SIGL, et al. - 1991 |

154 |
The maximum concurrent flow problem
- Shahrokhi, Matula
- 1990
(Show Context)
Citation Context ...hniques can be used to solve the problem efficiently [Shra87]. Next, it iteratively reduces the violations on the edge capacity constraints while maintaining a minimum feasible cost. Shahrokhi et al. =-=[Shah90]-=- proposes an approximation algorithm that can solve the 2-terminal multicommodity fractional flow problem in a relatively short period of time. When directly applied to global routing problem, this al... |

145 |
On Steiner’s Problem with Rectilinear Distance
- Hanan
- 1966
(Show Context)
Citation Context ...nentially with the number of terminals in a net. Therefore, only the RSTs that have some special feature, such as minimum length or limited number of bends are considered as the acceptable routes. In =-=[Hana66]-=-, it is proved that any Steiner Minimum Tree can be built on a grid obtained by drawing horizontal and vertical lines that pass through the vertices of the graph. This grid is usually referred to as H... |

113 | Can recursive bisection alone produce routable placements
- Caldwell, Kahng, et al.
- 2000
(Show Context)
Citation Context ...rn resulting in a larger routed wirelength [Yang01b]. Congested areas can also downgrade the performance of global routers, and in the worst case, create an unroutable placement in the fix-die regime =-=[Cald00]-=-. Although the congestion problem is often addressed in routing stage, the optimization performance is constrained because very little can be done to improve the routing and the overallsCHAPTER 2. BAC... |

111 |
The TimberWolf placement and routing package
- Sechen, Sangiovanni-Vincentelli
- 1985
(Show Context)
Citation Context ...unction used in simulated annealing search is equal to the sum of the total channel densities. Simulated Annealing is also applied to placement and global routing in the well-known TimberWolf package =-=[Sech85]-=-. In this package, a set of candidate routing trees is created for each net and one of the trees is randomly chosen as the initial solution. Each move implies a switch from one tree to another for a n... |

108 | Efficient and effective placement for very large circuits - SUN, SECHEN - 1995 |

105 |
On Steiner minimal trees with rectilinear distance
- Hwang
- 1976
(Show Context)
Citation Context ...t any Steiner point so that the total length of the tree is minimum, while in the case of minimum spanning tree, branching is allowed only at the terminal point locations. It has been proved by Hwang =-=[Hwan76]-=- that the ratio of the cost of minimum Spanning tree (MST) to that of an optimal rectilinear Steiner tree is no greater than 3. A minimum spanning tree for a given net can 2sCHAPTER 2. BACKGROUND 25 b... |

102 | A procedure for placement of standard-cell VLSI circuits - Dunlop, Kernighan - 1985 |

98 | A New Class of Iterative Steiner Tree Heuristics with Good Performance
- Kahng, Robins
- 1992
(Show Context)
Citation Context ...panning tree to that of an optimal rectilinear Steiner tree is no greater than 3. Based on Hwang’s result, Ho et al. 2 generate a Steiner tree by improving a minimum spanning tree topology [Ho90]. In =-=[Kahn92]-=-, a Batched Iterated 1-Steiner heuristic by Kahng and Robins produces the best quality solution among MRST heuristics. An improved implementation is presented in [Grif94] with computation time of O(n ... |

96 | An updated survey of GA-based multiobjective optimization techniques
- Coello
- 2000
(Show Context)
Citation Context ...feasible vector X that scores at least as well in all objective functions and strictly better in one. The Pareto optimum almost always gives a set of solutions, known as the Pareto optimal frontier P =-=[Coel00]-=- (as shown in Figure 2.12). The Pareto optimal frontier forms the boundary of the region defined by objective values for feasible solutions. When the behavior of the f 2 ∗ F ∗ f 1 ∗ f 2 Pareto Frontie... |

83 | VLSI cell placement techniques
- Shahookar, Mazumdar
- 1991
(Show Context)
Citation Context ...ce the total chip area is approximately equal to the area of the modules plus the area occupied by the interconnect, minimizing the wire-length is approximately equivalent to minimizing the chip area =-=[Shah91]-=-. Congestion minimization is another important objective of global routing. Each connection may have multiple possible paths, and by selecting an appropriate set, the routing demand in any given area ... |

77 | Estimating routing congestion using probabilistic analysis - LOU, THAKUR, et al. - 2002 |

76 |
Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Hadlock
- 1975
(Show Context)
Citation Context ...EVIEW 39 [Sait95]. To reduce the problem of storage, a coding scheme for labeling of grid cells have been proposed in [Aker67]. Several authors discuss goal-directed search techniques in [Souk78] and =-=[Hadl75]-=- to speed up maze routing algorithm. The major drawback of Lee’s maze routing algorithm and many of their variations is that the information data must be kept for each vertex. Thus, a very large memor... |

73 | Convergence of an annealing algorithm - Lundy, Mees - 1986 |

71 |
RISA: Accurate and Efficient Placement Routability Modeling
- Cheng
- 1994
(Show Context)
Citation Context ...ty of a given design. There are many interconnect estimation techniques, such as Rent’s rule based methods [Yang01b], Probabilistic based methods [Lou01, Chen04], and Simple bounding box based method =-=[Chen94]-=-, and so on. To examine the effectiveness of the congestion minimization, different measures are used to evaluate the results. The most commonly used congestion metrics are congestion map, the maximum... |

65 | Multi-level optimization for large-scale circuit placement - CHAN, CONG, et al. |

56 |
Kahng: Recent directions in netlist partitioning: a survey
- Alpert, B
- 1995
(Show Context)
Citation Context ...a century and many algorithmic techniques for other sub-tasks of physical design, such as placement are originated in application to partitioning. For a recent survey on the partitioning problem, see =-=[Alpe95]-=-. 2.1.2 Circuit Floorplanning and Placement Following the partitioning stage, the next step in the physical design cycle is to determine the shapes and locations of the partitioned subcircuits (i.e. b... |

54 | Congestion Minimization During Placement - Wang, Yang, et al. |

50 |
Hierarchical wire routing
- BURSTEIN, PELAVIN
- 1983
(Show Context)
Citation Context ... each level of the hierarchy, the nets in each 2 x 2 blocks are routed simultaneously by solving the corresponding linear programming problem. This method was first introduced by Burstein and Pelavin =-=[Burs83b]-=- for the gate-array layout style. However, it can not be applied to a custom chip design environment because of the assumption of the uniform wiring substrate. In [Luk87], Luk et al. proposed a top-do... |

49 | An edge-based heuristic for Steiner routing - Borah, Owens, et al. - 1994 |

47 | An effective congestion driven placement framework - BRENNER, ROHE |

44 | Statistical cooling : a general approach to combinatorial optimisation problems - Aarts, Laarhoven - 1985 |

43 | Closing the gap: Nearoptimal steiner trees in polynomial time
- Griffith, Robins, et al.
- 1994
(Show Context)
Citation Context ...ning tree topology [Ho90]. In [Kahn92], a Batched Iterated 1-Steiner heuristic by Kahng and Robins produces the best quality solution among MRST heuristics. An improved implementation is presented in =-=[Grif94]-=- with computation time of O(n 3 ). A more efficient approach was later proposed by Borah et al. [Bora94]. The performance of their algorithm is similar to the iterated 1-Steiner algorithm [Kahn92], wh... |

43 | Improved global routing through congestion estimation
- Hadsell, Madden
(Show Context)
Citation Context ...]. In practice, a technique called “rip-up and reroute” is often used after the sequential routing to remove blockages when further routing of nets is not possible [Aosh83, Ting83, Nair87, Lee91]. In =-=[Hads03]-=-, an amplified congestion estimate is used to influence a rip-up and reroute approach. During each rip-up and reroute iteration, the congestion information is obtained by a feed-back loop to guide the... |

38 |
Multilevel Approach to FullChip Gridless Routing
- Cong, Fang, et al.
(Show Context)
Citation Context ...on Inspired by the successful application of multilevel methods in circuit partitioning and placement [Kary97, Cong00, Chan00], the different multilevel routing approaches were proposed by Cong et al.=-=[Cong01]-=- and Lin et al. [L02]. In [Cong01], the router starts by recursively coarsening the global bins, and an estimation of routing resource is computed at each level, as illustrated in Figure 3.8. At the c... |

38 |
Fast maze router
- Soukup
- 1978
(Show Context)
Citation Context ... LITERATURE REVIEW 39 [Sait95]. To reduce the problem of storage, a coding scheme for labeling of grid cells have been proposed in [Aker67]. Several authors discuss goal-directed search techniques in =-=[Souk78]-=- and [Hadl75] to speed up maze routing algorithm. The major drawback of Lee’s maze routing algorithm and many of their variations is that the information data must be kept for each vertex. Thus, a ver... |

37 | A simple yet effective technique for global wiring - Nair - 1987 |

35 | Congestion Estimation During Top-down Placement
- Yang, Kastner, et al.
- 2002
(Show Context)
Citation Context ...a [AD85, Sun93, Klei91]. However, a placement with less total wirelength but highly congested regions often leads to routing detours around the region, in turn resulting in a larger routed wirelength =-=[Yang01b]-=-. Congested areas can also downgrade the performance of global routers, and in the worst case, create an unroutable placement in the fix-die regime [Cald00]. Although the congestion problem is often a... |

33 |
Global Wiring by Simulated Annealing
- Vecchi, Kirkpatrick
- 1983
(Show Context)
Citation Context ...CHAPTER 3. LITERATURE REVIEW 58 3.3 Meta Heuristic based Methods In addition to the previous mentioned techniques, different meta heuristic methods have been applied to the global routing problem. In =-=[Vecc83]-=-, the iterative technique: Simulated Annealing is applied to global routing, where only two-pin nets are considered and the number of bends for each net is no more than two. Initially, the nets are as... |

32 | Predictable routing
- Kastner, Bozorgzadeh, et al.
(Show Context)
Citation Context ...es congestion and net length simultaneously is achieved. Experimental results show that the proposed algorithm gives lower maximum channel density and shorter wirelength than [Chia90]. Kastner et al. =-=[Kast00b]-=- developed a pattern routing method that allows nets to be predictably routed. The authors show that using pattern routing, only a constant number of edges are searched for overflow information and th... |

31 | A new algorithm for standard cell global routing
- CONG, PREAS
- 1988
(Show Context)
Citation Context ...rWolf 5.6 under both the standard cell and gatesCHAPTER 3. LITERATURE REVIEW 60 array layout styles. The paper presented in [Cong97] incorporates the timing issue with an iterative deletion technique =-=[Cong92]-=- for standard-cell based global routing. Initially, a set of routes is generated for each net and optimized based on the global delay objectives. Feedthrough cells are then assigned to each row with t... |

29 |
A computer program for optimal routing of printed circuit connectors
- Mikami, Tabuchi
- 1968
(Show Context)
Citation Context ... vertex. Thus, a very large memory space is needed for solving a large grid graph. To further reduce the space requirement, line-probe algorithms have been introduced by Hightower [High69] and Mikami =-=[Mika68]-=-. In line-probe algorithms, the routing is performed by a bidirectional searching. Straight search lines are extended from both source point “S” and target point “T” in all four directions, as shown i... |

28 | An enhanced multilevel routing system
- Cong, Xie, et al.
- 2002
(Show Context)
Citation Context ... solutions in terms of the completion rate than classical hierarchical routing flow with much less computation time. The completionsCHAPTER 3. LITERATURE REVIEW 52 rate is further improved largely in =-=[Cong02]-=-. The major difference between [L02] and [Cong01] is that: (i) during the coarsening stage, the work in [L02] performs the global routing, detailed routing and routing resource estimation at each leve... |

28 | A novel framework for multilevel routing considering routability and performance
- Lin, Chang
- 2002
(Show Context)
Citation Context ...ssful application of multilevel methods in circuit partitioning and placement [Kary97, Cong00, Chan00], the different multilevel routing approaches were proposed by Cong et al.[Cong01] and Lin et al. =-=[L02]-=-. In [Cong01], the router starts by recursively coarsening the global bins, and an estimation of routing resource is computed at each level, as illustrated in Figure 3.8. At the coarsest level, a mult... |

27 |
Surviving the SOC Revolution
- Chang, Cooke, et al.
- 1999
(Show Context)
Citation Context ... that five blocks have been placed. Note that some space between the blocks is intentionally left empty to allow interconnections between blocks. It has been shown that placement is an NP-hard problem=-=[Chan99]-=-. When a large number of components are involved an optimal solution can not be obtained by using the exhaustive search method in reasonable amount of time. Therefore, heuristic algorithms are often u... |

27 | Performance Driven Multi-level and Multiway Partitioning with Retiming - Cong, Lim, et al. |

27 | Efficient Steiner tree construction based on spanning graphs
- Zhou
(Show Context)
Citation Context ...performance of their algorithm is similar to the iterated 1-Steiner algorithm [Kahn92], while the worst case running time is Θ(n 2 ). The most recently effort in this field is a new heuristic by Zhou =-=[Zhou04]-=-, which is based on the edge-substitution approach of Borah et al. [Bora94] and Zhou et al.’s spanning graph. The experimental results show that the performance of [Zhou04] is close to that of the 1-S... |

26 |
A global router using an efficient approximate multicommodity multiterminal flow algorithm
- Carden, Cheng, et al.
- 1991
(Show Context)
Citation Context ...elatively short period of time. When directly applied to global routing problem, this algorithm requiressCHAPTER 3. LITERATURE REVIEW 56 2-terminal nets and fractional flow assignments. Carden et al. =-=[Card91]-=- extend Shkhrohki et al.’s algorithm to handle multiterminal nets by decomposing a multiterminal net into several two-terminal nets. Furthermore, the fractional solutions are transformed to the intege... |

26 |
A global router based on a multicommodity flow model
- Shragowitz, Keel
- 1987
(Show Context)
Citation Context ...g solvers are slow for the sizes of problems encountered in global routing, research on the multicommodity flow problem has mostly focused on heuristics and combinatorial approximation algorithms. In =-=[Shra87]-=-, Shragowitz and Keel first presented a work on global routing using multicommodity flow model. This approach is based on a directed network graph and is restricted to two-pin nets. A min-cost multico... |

26 | Rectilinear Full Steiner Tree Generation - Zachariasen - 1999 |

25 |
Global routing based on steiner min–max tree
- Chiang, Sarrafzadeh
- 1990
(Show Context)
Citation Context ...obal routing that minimizes congestion and net length simultaneously is achieved. Experimental results show that the proposed algorithm gives lower maximum channel density and shorter wirelength than =-=[Chia90]-=-. Kastner et al. [Kast00b] developed a pattern routing method that allows nets to be predictably routed. The authors show that using pattern routing, only a constant number of edges are searched for o... |

25 |
Simultaneous Floorplanning and Global Routing for Hierarchical Building Block Layout
- Dai, Kuh
- 1987
(Show Context)
Citation Context ...fficiently. Burstein and Hong [Burs83a] combined hierarchical floorplanning and global routing together in the context of gate array layout and was later extended for general floorplans by Dai et al. =-=[Dai87]-=- and Lengauer et al. [Leng93]. In [Gegu00], a method based on hierarchical routing [Burs83b] and multi-layer routing model for high performance standard cell layout is presented. The routing area is d... |