Routability driven white space allocation for fixed-die standard-cell placement

@inproceedings{Yang2002RoutabilityDW,
  title={Routability driven white space allocation for fixed-die standard-cell placement},
  author={Xiaojian Yang and Bo-Kyung Choi and Majid Sarrafzadeh},
  booktitle={ISPD '02},
  year={2002}
}
The use of white space in fixed-die standard-cell placement is an effective way to improve routability. In this paper, we present a white space allocation approach that dynamically assigns white space according to the congestion distribution of the placement. In the top-down placement flow, white space is assigned to congested regions using a smooth allocating function. A post allocation optimization step is taken to further improve placement quality. Experimental results show that the proposed… Expand
Routability-driven placement and white space allocation
We present a two-stage congestion-driven placement flow. First, during each refinement stage of our multilevel global placement framework, we replace cells based on the wirelength weighted byExpand
Routability-driven placement and white space allocation
TLDR
A two-stage congestion-driven placement flow that replaces cells based on the wirelength weighted by congestion level to reduce the routing demands of congested regions and allocates appropriate amounts of white space according to a congestion map to significantly improve the routability of placements generated by other placement tools. Expand
Flow-Based White Space Allocation for Fixed-Die Standard Cell Placement
  • 2002
Routability is one of the most critical metrics to evaluate the quality of standard cell placement In xed die place ment white space can be used to alleviate congestion and achieve better routabilityExpand
Routability-driven placement and white space allocation
We present a congestion-driven placement flow. First, we consider in the global placement stage the routing demand to replace cells in order to avoid congested regions. Then we allocate appropriateExpand
Routability-driven analytical placement by net overlapping removal for large-scale mixed-size designs
TLDR
A new direction/technique is proposed, called net overlapping removal, to optimize the routability during placement, and a Gaussian smoothing technique is proposed to handle the challenging macro porosity issue, arising in modern mixed-size designs with large macros. Expand
Fast and Effective Placement Refinement for Routability
  • Yanheng Zhang, C. Chu
  • Computer Science
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • 2013
TLDR
The experimental results show that CROP effectively alleviates congestion for unroutable placement solutions in short runtimes for different placers. Expand
Routability-driven Placement for Mixed-size Designs using Design-hierarchy and Pin Information
TLDR
A routability-driven placement for large mixed-size standard cell designs is proposed and the implemented algorithms outperforms the other recent routable-driven placers on ICCAD 2012 benchmarks. Expand
Routability-driven analytical placement for mixed-size circuit designs
TLDR
A novel routability-driven analytical placement algorithm for large-scale mixed-size circuit designs that achieves the best average overflow and routed wirelength and considers the constrained routing resource incurred by big macros. Expand
Effective free space management for cut-based placement via analytical constraint generation
TLDR
An enhancement to cut-based placement called analytic constraint generation (ACG), which utilizes an analytic engine to distribute available free space appropriately by determining balance constraints for each partitioning step and significantly improves the performance of cut- based placement, particularly timing perspective, as implemented within a state-of-the-art industrial placer. Expand
NTUplace4h: A Novel Routability-Driven Placement Algorithm for Hierarchical Mixed-Size Circuit Designs
TLDR
A novel design hierarchy identification technique to effectively identify design hierarchies and guide placement for better wirelength and routability and to further optimize routing congestion is presented. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
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
RISA: accurate and efficient placement routability modeling
TLDR
An accurate and efficient placement routability modeling technique is proposed and incorporated into the prevailing simulated annealing approach based on the supply versus demand analysis of routing resource over an array of regions on a chip. Expand
NRG: global and detailed placement
TLDR
NRG puts all algorithms together in a placement package called NRG (pronounced N-er-G), in addition to area minimization, NRG can perform timing-driven placement and can also serve as a fast and accurate predictor. Expand
Congestion-driven placement using a new multi-partitioning heuristic
  • Stefan Mayrhofer, U. Lauther
  • Computer Science
  • 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers
  • 1990
A novel hierarchical top down placement technique is presented for circuits implemented in the sea-of-gates design style. It is based on a new hypergraph multi-partitioning algorithm, whose timeExpand
Congestion minimization during placement
TLDR
It is shown that a global placement with minimum wirelength has minimum total congestion and that minimizing wirelength may (and in general, will) create locally congested regions. Expand
TimberWolf3.2: A New Standard Cell Placement and Global Routing Package
TLDR
Local changes are made to the placement whenever such changes result in a reduction in the number of wiring tracks required, and TimberWolf3.2 has achieved area savings ranging from 15 to 75% in experiments on numerous industrial circuits. 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
A class of min-cut placement algorithms
TLDR
A class of min-cut placement algorithms for solving some assignment problems related to the physical implementation of electrical circuits and the need for abandoning classical objective functions based upon distance, and introducing new objective functionsbased upon "signals cut". 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
...
1
2
...