Can recursive bisection alone produce routable, placements?

@article{Caldwell2000CanRB,
  title={Can recursive bisection alone produce routable, placements?},
  author={Andrew E. Caldwell and Andrew B. Kahng and Igor L. Markov},
  journal={Proceedings 37th Design Automation Conference},
  year={2000},
  pages={477-482}
}
This work focuses on congestion-driven placement of standard cells into rows in the fixed-die context. We summarize the state-of-the-art after two decades of research in recursive bisection placement and implement a new placer, called Capo, to empirically study the achievable limits of the approach. From among recently proposed improvements to recursive bisection, Capo incorporates a leading-edge multilevel min-cut partitioner [7], techniques for partitioning with small tolerance [8], optimal… 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
On legalization of row-based placements
TLDR
This work traces cell overlaps in min-cut placement to vertical cuts and shows that, if bisection cut directions are varied, overlaps anti-correlate with improved wirelength, and proposes new techniques that improve overall routability and routed wirelength. Expand
On Improving Recursive Bipartitioning-Based Placement
TLDR
An improved partitioning-based placement tool in terms of the half-perimeter wirelength that generates white spaces during the legalization step and treats white spaces as pseudo cells during the detailed placement step and is the best among all the existing public academic placement tools. Expand
Partitioning-based Methods for VLSI Placement
The technique of using balanced min-cut partitioning in placement was presented by Breuer in 1977 [7]. Such min-cut placers use scalable and extensible divide-and-conquer algorithmic framework andExpand
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
Global objectives for standard cell placement
TLDR
This work focuses on aspects of the placement problem which cannot be captured with bisection, addressing them through a new approach derived from recent work on k-way partitioning, which considers large values of k, and objective functions which are more complex than the traditional min-cut. Expand
Mixed block placement via fractional cut recursive bisection
  • A. Agnihotri, S. Ono, +4 authors P. Madden
  • Computer Science
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2005
TLDR
This technique, which is referred to as a fractional cut, simplifies mixed block placement and also avoids a narrow region problem encountered in standard cell placement, and is competitive with leading methods on standard cell designs. Expand
Timing-driven placement based on monotone cell ordering constraints
TLDR
A new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit and integrates this idea into a recursive bipartitioning-based placement framework with a min-cut objective function. 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
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 61 REFERENCES
Optimal partitioners and end-case placers for standard-cell layout
We study alternatives to classic Fiduccia-Mattheyses (FM)-based partitioning algorithms in the context of end-case processing for top-down standard-cell placement. While the divide step in theExpand
Partitioning around roadblocks: tackling constraints with intermediate relaxations
Constraint satisfaction during partitioning and placement of VLSI circuits is an important problem, and effective techniques to address it lead to high-quality physical design solutions. This problemExpand
Partitioning-based standard-cell global placement with an exact objective
TLDR
A new top-down quadrisection-based global placer for standard-cell layout called QUAD is presented, which can achieve improvements in wirelength and congestion distribution over GORDIAN-L/DOMINO (a leading quadratic placer with linear wirelength objective and detailed placement improvement). Expand
Improved algorithms for hypergraph bipartitioning
TLDR
This work presents new techniques for flat FM-based hypergraph partitioning, which confirm the conjecture that specialized partitioning heuristics may be able to actively exploit fixed nodes in partitioning instances arising in the driving top-down placement context, and a new multilevel implementation that offers leading-edge performance. Expand
On the behavior of congestion minimization during placement
TLDR
The notion of consistent routing model is introduced and promote its adoption by placement systems and it is shown that in this model the wirelength objective is indeed a good measure of congestion by establishing that a placement with minimum wirelength has minimum total congestion. Expand
Quadratic placement revisited
TLDR
Evidence that the use of numerical linear systems solvers with quadratic wirelength objective may be due to the pre-1990's weakness of min-cut partitioners is provided, and emerging methodology drivers in deep-submicrondesign that may require new placement approaches to the placement problem are noted. Expand
Min-cut placement with global objective functions for large scale sea-of-gates arrays
TLDR
A new min-cut based placement algorithm for large scale sea-of-gates arrays based on a new global objective function based on the congestions for cut lines and use it for the selection of clusters and a cut line sequence. Expand
Iterative placement improvement by network flow methods
TLDR
This work describes an efficient iterative improvement procedure for row-based cell placement with special emphasis on the objective function used to model net lengths, and proves theoretically that the net models are accurate approximations of the widely used half perimeter of a rectangle enclosing all pins of a net. Expand
Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning
TLDR
A detailed software architecture is presented, consisting of seven reusable components, that allows flexible, efficient and accurate assessment of the practical implications of new move-based algorithms and partitioning formulations in the context of VLSI design applications. 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
...
1
2
3
4
5
...