On interactions between routing and detailed placement

@inproceedings{Jariwala2004OnIB,
  title={On interactions between routing and detailed placement},
  author={D. Jariwala and J. Lillis},
  booktitle={ICCAD 2004},
  year={2004}
}
The main goal of This work is to develop deeper insights into viable placement-level optimization of routing. Two primary contributions are made. First, an experimental framework in which the viability of predictive models of routing congestion for optimization during detailed placement can be evaluated, is developed. The main criteria of consideration in these experiments is how (un)reliably various models from the literature detect routing hot-spots. We conclude that such models appear to be… 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
Trunk Decomposition Based Global Routing Optimization
  • D. Jariwala, J. Lillis
  • Computer Science
  • 2006 IEEE/ACM International Conference on Computer Aided Design
  • 2006
TLDR
The routing approach produces better results compared to rip-up and re-route method based router Labyrinth with average total overflow reduction of more than 88% while taking only 61% of runtime required by rip up and reroute phase of Labyrinth. Expand
Seeing the Forest and the Trees: Steiner Wirelength Optimization in Placement
  • J. A. Roy, I. Markov
  • Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 2007
TLDR
A technique to optimize StWL in global and detail placement without a significant runtime penalty is developed, and this new optimization, along with congestion-driven whitespace distribution, improves overall Place-and-Route results, making the use of HPWL unnecessary. Expand
GDP: GPU accelerated Detailed Placement
  • S. Dhar, D. Pan
  • Computer Science
  • 2018 IEEE High Performance extreme Computing Conference (HPEC)
  • 2018
TLDR
This paper demonstrates GPU acceleration of a dynamic programming based detailed placement algorithm which solves a generalized version of the Linear Arrangement Problem and achieves upto 7x speedup in runtime over multi-threaded CPU implementation without any loss of QoR. Expand
An integrated placement and routing approach
topology Figure 4.6 Abstract topology Steiner nodes) on Hanan grid and the connections between nodes. The only difference between equivalent topologies is the embedding for the connections. ToExpand
Routing Congestion in VLSI Circuits - Estimation and Optimization
TLDR
The Origins of Congestion, an Introduction to Routing Congestions, and the Estimation ofCongestion: The Estimation and Optimization. Expand
Crosstalk minimization in VLSI design using signal transition avoidance
TLDR
The crosstalk noise model is a proposed concept of effective signal transition consideration and is developed based on a decreasing coupling technique exhibiting a total energy of 6.9 as compared to average energy of all possible patterns. Expand
Power Optimization and Prediction Techniques for FPGAs
TLDR
Two novel computer-aided design techniques for FPGA leakage power reduction are presented, which are unique in that they substantially reduce leakage power, while imposing no cost, meaning that they have no impact on FPGAs area-efficiency, speed, or fabrication cost. Expand

References

SHOWING 1-10 OF 14 REFERENCES
An effective congestion-driven placement framework
TLDR
A fast but reliable way to detect routing criticalities in very large scale integration chips by using the congestion estimator for a dynamic avoidance of routability problems in one single run of the placement algorithm. Expand
Risa: Accurate And Efficient Placement Routability Modeling
The prevalence of net list synthesis tools raises great concern on routability of cell placement created with state-of-the-art placement techniques. In this paper, an accurate and efficient placementExpand
Multi-center congestion estimation and minimization during placement
TLDR
A mathematical equation to predict the overflow within a region using a normal distribution approximation is given and it is shown that this equation does give a good estimation of overflow. Expand
VPR: A new packing, placement and routing tool for FPGA research
TLDR
In terms of minimizing routing area, VPR outperforms all published FPGA place and route tools to which the authors can compare and presents placement and routing results on a new set of circuits more typical of today's industrial designs. 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 accuracy and fast runtime. 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
Performance-driven simultaneous placement and routing for FPGA's
  • S. Nag, R. Rutenbar
  • Engineering, Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1998
TLDR
A set of new performance-driven simultaneous placement/routing techniques has been developed for both row-based and island-style FPGA designs that rely on an iterative improvement placement algorithm augmented with fast, complete routing heuristics in the placement loop. Expand
Congestion estimation during top-down placement
TLDR
This paper theoretically analyzes the peak-congestion value of the design and experimentally validate the estimation approach, and shows that the early congestion estimation based on Rent's rule is a promising approach. 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
Routability driven white space allocation for fixed-die standard-cell placement
TLDR
A white space allocation approach that dynamically assigns white space according to the congestion distribution of the placement, combined with a multilevel placement flow, significantly improves placement routability and layout quality. Expand
...
1
2
...