FastRoute: A Step to Integrate Global Routing into Placement

@article{Pan2006FastRouteAS,
  title={FastRoute: A Step to Integrate Global Routing into Placement},
  author={Min Pan and C. Chu},
  journal={2006 IEEE/ACM International Conference on Computer Aided Design},
  year={2006},
  pages={464-471}
}
  • Min Pan, C. Chu
  • Published 2006
  • Computer Science
  • 2006 IEEE/ACM International Conference on Computer Aided Design
Because of the increasing dominance of interconnect issues in advanced IC technology, placement has become a critical step in the IC design flow. To get accurate interconnect information during the placement process, it is desirable to incorporate global routing into it. However, previous global routers are computationally expensive. It is impractical to perform global routing repeatedly during placement. In this paper, we present an extremely fast and high-quality global router called… Expand
IPR: An Integrated Placement and Routing Algorithm
  • Min Pan, C. Chu
  • Computer Science
  • 2007 44th ACM/IEEE Design Automation Conference
  • 2007
TLDR
This paper proposes to address the inconsistency between the placement and routing objectives by fully integrating global routing into placement and calls the proposed algorithm for routing congestion minimization IPR (integrated placed and routing). Expand
Archer: A History-Based Global Routing Algorithm
  • M. M. Ozdal, M. Wong
  • Mathematics, Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2009
TLDR
This paper proposes an RNR-based global routing algorithm that guides the routing iterations out of local optima through effective usage of congestion histories, and proposes a Lagrangian relaxation-based bounded-length min-cost topology improvement algorithm that enables Steiner trees to change dynamically for the purpose of congestion optimization. Expand
FastRoute: An Efficient and High-Quality Global Router
TLDR
This work proposes a very efficient and high-quality global router--FastRoute that integrates several novel techniques: fast congestion-driven via-aware Steiner tree construction, 3- bend routing, virtual capacity adjustment, multisource multi-sink maze routing, and spiral layer assignment. Expand
Archer: a history-driven global routing algorithm
TLDR
This paper proposes an RNR-based global routing algorithm that guides the routing iterations out of local optima through effective usage of congestion histories, and proposes a Lagrangian relaxation based bounded-length min-cost topology improvement algorithm that enables Steiner trees to change dynamically for the purpose of congestion optimization. Expand
CUGR: Detailed-Routability-Driven 3D Global Routing with Probabilistic Resource Model
TLDR
This paper proposes two routing techniques that directly operate on the 3D routing space and can maximally utilize the3D structure of a grid graph and designs a cost function that is sensitive to resources changes and a post-processing technique that gives the detailed router more flexibility in escaping congested regions. Expand
Detailed-Routing Algorithms for Dense Pin Clusters in Integrated Circuits
  • M. M. Ozdal
  • Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2009
TLDR
This paper proposes a polynomial-time algorithm that guarantees to find the optimal escape-routing solution for a set of nets when the track structures are uniform, and proposes a novel multicommodity-flow (MCF) model that has a one-to-one correspondence with the escape- routing problem. Expand
Timing-Driven Routing in VLSI Physical Design Under Uncertainty
TLDR
This work tries to find a fundamental strategy to address the timing-driven Steiner tree construction problem subject to congestion constraints and process variation, and builds on this approach to accommodate the variation-aware statistical delay/timing requirements. Expand
Efficient simulated evolution based rerouting and congestion-relaxed layer assignment on 3-D global routing
TLDR
This work presents two routing techniques, namely adaptive pseudorandom net-ordering routing and evolution-based rip-up and reroute using a two-stage cost function in a high-performance congestion-driven 2-D global router. Expand
GDRouter: Interleaved global routing and detailed routing for ultimate routability
TLDR
Experimental results reveal that the newly proposed GDRouter is capable of enhancing detailed routing routability, and reduces number of unassigned global segments by 90% for ISPD98 derived testcases and around 60% forISPD05/06 derived test cases with 2.9× runtime overhead. Expand
Routability-driven placement algorithm for analog integrated circuits
TLDR
Experimental results show that the analog placer can effectively minimize routing congestion without violating the symmetry property after placement expansion, and to reduce running time, the placement algorithm first generates a compact placement to minimize wirelength and area without considering congestion problem. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 22 REFERENCES
An effective congestion driven placement framework
TLDR
A fast but reliable way to detect routing criticalities in VLSI chips by using a congestion estimator for a dynamic avoidance of routability problems in one single run of the placement algorithm. Expand
Estimating routing congestion using probabilistic analysis
TLDR
A net-based stochastic model for computing expected horizontal and vertical track usage, which considers routing blockages is proposed and the main advantages of this algorithm are its accuracy and fast runtime. Expand
Global routing by new approximation algorithms for multicommodityflow
  • Christoph Albrecht
  • Mathematics, Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 2001
TLDR
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. Expand
Dragon2000: standard-cell placement tool for large industry circuits
  • Maogang Wang, Xiaojian Yang, M. Sarrafzadeh
  • Engineering, Computer Science
  • IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140)
  • 2000
TLDR
It is argued that net-cut minimization is a good and important shortcut to solve the large scale placement problem and is shown to be more important than greedily obtain a wirelength optimal placement at intermediate hierarchical levels. Expand
Can recursive bisection alone produce routable, placements?
TLDR
The state-of-the-art after two decades of research in recursive bisection placement is summarized and a new placer is implemented, called Capo, to empirically study the achievable limits of the approach and validates fixed-die placement results by violation-free detailed auto-routability. Expand
Generic global placement and floorplanning
  • H. Eisenmann, F. Johannes
  • Computer Science
  • Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175)
  • 1998
TLDR
The algorithm is capable of addressing the problems of global placement, floorplanning, timing minimization and interaction to logic synthesis, and its iterative nature assures that timing requirements are precisely met. Expand
SPEED: fast and efficient timing driven placement
TLDR
A timing driven placement approach for very large circuits is described, and results of benchmark circuits with up to 25,000 cells show an excellent quality in terms of maximum path delay and total area after final routing. Expand
Is probabilistic congestion estimation worthwhile?
TLDR
The results presented in this paper indicate that global routing based methods are probably more worthwhile than probabilistic methods. Expand
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
TLDR
A new net breaking technique which is much better than the one in [1] and is particularly suitable for VLSI applications in which most nets have a degree 30 or less. Expand
Probabilistic congestion prediction
TLDR
This paper shows experimentally that the number of two-pin nets with more than two bends in the actual router is negligible, and it is established that the ratio between the numbers of L-shapes and Z-sh shapes is more or less a constant. Expand
...
1
2
3
...