Proceedings Article10.1109/CCECE.2008.4564673
An effective congestion-based integer programming model for VLSI global routing
Laleh Behjat,A. Chiang,Logan Rakai,Jianhua Li +3 more
- 04 May 2008
- pp 000931-000936
3
TL;DR: A fast, order-free global routing technique is proposed by formulating the global routing problem as an integer linear programming (ILP) problem and it is shown to be faster than the sequential router Labyrinth.
read more
Abstract: Global routing is a fundamental problem in VLSI physical design in which approximate paths for the interconnect (wires) of a circuit are decided. In this paper, a fast, order-free global routing technique is proposed by formulating the global routing problem as an integer linear programming (ILP) problem. A small set of high quality trees, in terms of congestion and length, for each net in the circuit is first produced. Then, a preprocessing technique is proposed to reduce problem sizes while maintaining solution quality. Evaluating performance on the IBM-place 2.0 suite shows a 19.5% average reduction in maximum channel capacity and a 71% average improvement in solving times compared to the traditional concurrent techniques. The proposed concurrent technique is also shown to be faster than the sequential router Labyrinth.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
XGRouter: high-quality global router in X-architecture with particle swarm optimization
TL;DR: To the best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global routing problem in X-architecture and can produce solutions of higher quality than other global routers.
52
Multi-objective Floorplanning optimization engaging dynamic programming for system on chip
Dayasagar Chowdary S,Sudhakar Ms +1 more
TL;DR: This study proposes Weighted Aggregated DP-Based Floorplanning (WADPFP), a dynamic programming approach that optimizes VLSI Floorplanning by minimizing area, wirelength, and temperature, achieving 6.05%, 13%, and 4.35% reductions respectively on benchmark circuits.
3
Linear programming-based multi-objective floorplanning optimization for system-on-chip
S. Dayasagar Chowdary,M. S. Sudhakar +1 more
1
References
Global routing by new approximation algorithms for multicommodity flow
TL;DR: It is shown that not only the maximum relative congestion is minimized, but the congestion of the edges is distributed equally such that the solution is optimal in a well-defined sense.
132
MARS-a multilevel full-chip gridless routing system
TL;DR: A number of efficient techniques in the multilevel routing scheme are introduced, including resource reservation, graph-based Steiner tree heuristic and history-based iterative refinement, which allows for scaling of the gridless routing system to very large designs.
65
MR: a new framework for multilevel full-chip routing
Yao-Wen Chang,Shih-Ping Lin +1 more
TL;DR: A novel framework for multilevel full-chip routing considering both routability and performance called MR, which integrates global routing, detailed routing, and resource estimation, together at each level of the framework, leading to more accurate routing resource estimation during coarsening and thus facilitating the solution refinement during uncoarsening.
An exact algorithm for coupling-free routing
Ryan Kastner,Elaheh Bozorgzadeh,Majid Sarrafzadeh +2 more
- 01 Apr 2001
TL;DR: Methods to reduce interconnect delay and noise caused by coupling are developed and a new algorithm for the Maximum Coupling-Free Layout (MAX-CFL) problem is developed, which uses properties assoicated with the implication graph.