Dragon2000: standard-cell placement tool for large industry circuits

@article{Wang2000Dragon2000SP,
  title={Dragon2000: standard-cell placement tool for large industry circuits},
  author={Maogang Wang and Xiaojian Yang and Majid Sarrafzadeh},
  journal={IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140)},
  year={2000},
  pages={260-263}
}
  • Maogang Wang, Xiaojian Yang, M. Sarrafzadeh
  • Published 2000
  • Engineering, Computer Science
  • IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140)
In this paper, we develop a new standard cell placement tool, Dragon2000, to solve large scale placement problem effectively. A top-down hierarchical approach is used in Dragon2000. State-of-the-art partitioning tools are tightly integrated with wirelength minimization techniques to achieve superior performance. We argue that net-cut minimization is a good and important shortcut to solve the large scale placement problem. Experimental results show that minimizing net-cut is more important than… Expand
Congestion Minimization in Modern Placement Circuits
TLDR
This chapter proposes a placement tool called Dragon which deploys hierarchical techniques to place large-scale mixed size designs that may contain thousand of macro blocks and millions of standard cells and effectively produce legal final layouts with a short runtime. Expand
Combinatorial techniques for mixed-size placement
TLDR
This work shows how to place macros consistently with large numbers of small standard cells and addresses the computational difficulty of layout problems involving large macros and numerous small logic cells at the same time. Expand
Large-Scale Circuit Placement: Gap and Promise
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 deepExpand
Large-Scale Circuit Placement : Gap and Progress
Recently, the PEKO studies have given evidence of how far computed placement solutions are from optimal and how much the deviation from optimality is likely to grow with respect to problem size. TheExpand
WRIP: logic restructuring techniques for wirelength-driven incremental placement
TLDR
WRIP is the first attempt to fully integrate powerful logic synthesis into industrial placement tools with real-life effectiveness and efficiency and reduces the wirelength under an accurate estimation of the half perimeter wirelength (HPWL) metric. Expand
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
Placement feedback: a concept and method for better min-cut placements
  • A. Kahng, S. Reda
  • Computer Science
  • Proceedings. 41st Design Automation Conference, 2004.
  • 2004
TLDR
This work identifies a previously overlooked problem - ambiguous terminal propagation - and proposes a solution based on the concept of feedback from automatic control systems, which significantly improves routability without building congestion maps, and reduces the number of vias. Expand
Consistent placement of macro-blocks using floorplanning and standard-cell placement
TLDR
This work shows how to place macros consistently with large numbers of small standard cells, and combines floorplanning techniques with placement techniques in adesign flow that solves the more general placement problem. Expand
Large-scale circuit placement
TLDR
This tutorial summarizes results from recent optimality and scalability studies of existing placement tools, and highlights the recent progress on large-scale circuit placement, including techniques for wirelength minimization, routability optimization, and performance optimization. Expand
A standard-cell placement tool for designs with high row utilization
TLDR
Experimental results show that minimizing wirelength improves routability and layout quality, and compared to an industrial placer and an academic state-of-the-art placer, Dragon can produce placement with better routable and shorter total wirelength. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 12 REFERENCES
A snap-on placement tool
TLDR
A new snap-on placement tool, which is based on multilevel hierarchical placement method, which has great flexibility to combine existing packages and techniques in its top-down framework and can be used to build a good placement tool in a short amount of time. 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
NRG: global and detailed placement
  • M. Sarrafzadeh, Maogang Wang
  • Computer Science
  • 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD)
  • 1997
TLDR
NRG, a new approach to the placement problem that consists of analyzing the input circuit and deciding on a two-dimensional global grid for that particular input, and shows that the output of the global placement can also serve as a fast and accurate predictor. Expand
GORDIAN: VLSI placement by quadratic programming and slicing optimization
The authors present a placement method for cell-based layout styles. It is composed of alternating and interacting global optimization and partitioning steps that are followed by an optimization ofExpand
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
A loosely coupled parallel algorithm for standard cell placement
TLDR
This is the very first reported parallel algorithm for standard cell placement which yields as good or better placement results than its serial version, and the first parallel placement algorithm reported which offers nearly linear speedup, in terms of the number of processors (workstations) used, over the serial version. Expand
A Loosely Coupled Parallel Algorithm For Standard Cell Placement
  • W. Sun, C. Sechen
  • Computer Science
  • IEEE/ACM International Conference on Computer-Aided Design
  • 1994
TLDR
This is the very first reported parallel algorithm for standard cell placement which yields as good or better placement results than its serial version, and the first parallel placement algorithm reported which offers nearly linear speedup, in terms of the number of processors (workstations) used, over the serial version. Expand
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
A Procedure for Placement of Standard-Cell VLSI Circuits
  • A. Dunlop, B. Kernighan
  • Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1985
TLDR
A method of automatic placement for standard cells (polycells) that yields areas within 10-20 percent of careful hand placements is described, based on graph partitioning to identify groups of modules that ought to be close to each other. Expand
The ISPD98 circuit benchmark suite
TLDR
The ISPD98 benchmark suite is introduced which consists of 18 circuits with sizes ranging from 13,000 to 210,000 modules and Experimental results for three existing partitioners are presented so that future researchers in partitioning can more easily evaluate their heuristics. Expand
...
1
2
...