Large-Scale Circuit Placement: Gap and Promise

@inproceedings{Cong2003LargeScaleCP,
  title={Large-Scale Circuit Placement: Gap and Promise},
  author={J. Cong and Tim Kong and J. Shinnerl and M. Xie and Xin Yuan},
  booktitle={ICCAD 2003},
  year={2003}
}
Placement is one of the most important steps in the RTL-to-GDSII synthesis process, as it directly defines the interconnects, which have become the bottleneck in circuit andsystem performance in deep submicron technologies. Theplacement problem has been studied extensively in the past30 years. However, recent studies show that existing placement solutions are surprisingly far from optimal. The first part of this tutorial summarizes results from recent optimality and scalability studies of… Expand

Figures from this paper

Wirelength minimization for min-cut placements via placement feedback
  • A. Kahng, S. Reda
  • Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2006
TLDR
This work carefully reexamined the repartitioning problem in the context of terminal propagation, and the method proposed significantly improves routability without building congestion maps and also reduces the number of vias. Expand
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
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
On the Use of Directed Moves for Placement in VLSI CAD
TLDR
The ways in which directed moves can be used to improve the quality of FPGA placements, improve the robustness of floorplan repair and legalization methods for mixed-size standard cell designs, and enhance thequality of detailed placement for standard cell circuits are explored. Expand
Interleaving of Gate Sizing and Constructive Placement for Predictable Performance
TLDR
This paper presents a fast fixed-die standard cell placement algorithm that achieves a combination of top-down partitioning with the incremental row-by-row construction by adapting dynamically recomputed net delay bounds. Expand
A tale of two nets: studies of wirelength progression in physical design
TLDR
This work defines and uses a metric to measure the consistency of optimizing wirelength during the different stages of physical design and proposes a simple method to quantify the similarity between the results of different tools. Expand
Congestion-Driven Placement Improvement Using Cell Spreading
As technology moves into VDSM arena, the integration density of ICs goes higher and higher. It makes the congestion a global issue, for it appears in many pieces on the chip while not only in someExpand
On The Engineering of a Stable Force-Directed Placer
Analytic and force-directed placement methods that simultaneously minimize wire length and spread cells are receiving renewed attention from both academia and industry. However, these methods are byExpand
Effective linear programming based placement methods
TLDR
The scope of LP-based methods is expanded from just operating on a small subset of cells to operating on all cells of a functional block circuit and a benchmarking study is conducted, where it is surprisingly shown that academic placers fail to consistently produce good results on relatively small functional blocks. Expand
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
...
1
2
3
...

References

SHOWING 1-10 OF 77 REFERENCES
Optimality and scalability study of existing placement algorithms
  • Chin-Chih Chang, J. Cong, M. Xie
  • Engineering, Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2004
TLDR
This study reveals the gap between the results produced by these tools versus true optimal solutions and finds that the effectiveness of the algorithms varies for circuits with different characteristics, indicating significant room for improvement in existing placement algorithms. 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
Performance-Driven Placement of Cell Based IC's
  • M. Jackson, E. Kuh
  • Engineering, Computer Science
  • 26th ACM/IEEE Design Automation Conference
  • 1989
TLDR
A novel approach to performance-driven placement is presented, combining timing analysis and physical design to dynamically optimize the performance of the chip during placement. 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
Multilevel optimization for large-scale circuit placement
  • T. Chan, J. Cong, T. Kong, J. Shinnerl
  • Computer Science
  • IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140)
  • 2000
TLDR
A new class of fast and highly scalable placement algorithms that directly handle complex constraints and achieve total wirelengths comparable to the state of the art are designed and implemented. Expand
Timing Driven Placement for Large Standard Cell Circuits
TLDR
The timing optimization algorithm has been added to the placement algorithm which has yielded the best results ever reported on the full set of MCNC benchmark circuits, including a circuit containing more than 100,000 cells. Expand
Benchmarking for large-scale placement and beyond
Over the last five years, the large scale integrated circuit placement community achieved great strides in the understanding of placement problems, developed new high-performance algorithms, andExpand
An analytic net weighting approach for performance optimization in circuit placement
  • R. Tsay, J. Koehl
  • Computer Science
  • 28th ACM/IEEE Design Automation Conference
  • 1991
TLDR
An efficient circuit placement approach based on analytic net weighting controls for nonlinear performance constraints and a quantitative analysis of the ef- fect ofNet weighting to wire length change is given. Expand
Module Placement Based on Resistive Network Optimization
  • Chung-Kuan Cheng, E. Kuh
  • Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1984
TLDR
A new constructive placement and partitioning method based on resistive network optimization is proposed, which is efficient because it takes advantage of net-list sparsity and has a complexity of O[n1.4 log n]. Expand
Timing Influenced Layout Design
TLDR
This work presents a new approach to the automatic layout design for VLSI chips which incorporates timing information to influence the placement and wiring processes, and adds a third phase of timing to the hierarchy without affecting the computational complexity of the basic algorithm. Expand
...
1
2
3
4
5
...