SimPL: An effective placement algorithm

  title={SimPL: An effective placement algorithm},
  author={Myung-Chul Kim and Dongjin Lee and Igor L. Markov},
  journal={2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)},
We propose a self-contained, flat, force-directed algorithm for global placement that is simpler than existing placers and easier to integrate into timing-closure flows. [] Key Method The upper-bound placement is produced by a novel rough legalization algorithm. Our placer SimPL outperforms mPL6, NTUPlace3, FastPlace3, APlace2 and Capo simultaneously in runtime and solution quality, running 6.4 times faster than mPL6 and reducing wirelength by 2% on the ISPD 2005 benchmark suite.

Figures and Tables from this paper

A size scaling approach for mixed-size placement

A global placement algorithm that employs size scaling of circuit components to provide continuity during placement by using the optimal region approach to first determine an initial placement, which allows the global placement algorithms to converge to better placement solutions.

Multi-Commodity Flow-Based Spreading in a Commercial Analytic Placer

A new, network flow-based approach for UB placement which does a better job of preserving quality by optimizing the displacement of cells from their LB positions and also accommodates complex region constraints and simultaneously spreads unit-sized logic, carry chains, and blocks like RAMs and DSPs.

PyPUT: Python-based Placement Utilities Toolset

This paper presents an open-source Python-based toolset for the development of placement algorithms, and presents an efficient placement algorithm combined with an appropriate routing algorithm that can attain a design without manufacturability issues.

Blockage-aware terminal propagation for placement wirelength minimization

This paper presents an efficient, generic, yet effective terminal propagation algorithm as a pre-placement process which can readily be integrated into a traditional placement flow to improve wirelength (and routability) and provides a long unnoticed insight into placement optimization with blockages.

An effective iterative density aware detailed placement algorithm

This work presents an effective detailed placement algorithm for total HPWL and density optimization, which performs a density-aware cell swapping technique to improve wirelength and cell density.

High performance global placement and legalization accounting for fence regions

A comprehensive technique to address fence region constraints in global placement and legalization while still considering detailed-routing issues is presented and a heuristic method to adjust target densities while avoiding adverse effects on the quality of global routability is introduced.

Cell density-driven detailed placement with displacement constraint

This paper proposes a detailed placement algorithm for minimizing wire-length, while preserving the global placement solution by cell displacement constraint and target cell density objective.

OptiPlace: optimized placement solution for mixed-size designs

An optimized placement approach for mixed-size designs that achieves improvised results than the contemporary in terms of HPWL, scaled wirelength, and routability and is experimentally tested on ICCAD 2012 contest benchmarks.

DREAMPlace 3.0: Multi-Electrostatics Based Robust VLSI Placement with Region Constraints

This work proposes a versatile and robust placer to solve region-constrained placement problems with better solution quality and faster convergence and adopts self-adaptive quadratic density penalty and entropy injection techniques to automatically accelerate and stabilize the nonlinear optimization.

Ripple 2.0: High quality routability-driven placement via global router integration

This paper presents a high quality placer Ripple 2.0 to solve the routability-driven placement problem and proposes several techniques, including lookahead routing analysis with pin density consideration, routing path-based cell inflation and spreading and robust optimization on congested cluster.



FastPlace 3.0: A Fast Multilevel Quadratic Placement Algorithm with Placement Congestion Control

This work presents FastPlace 3.0 - an efficient and scalable multilevel quadratic placement algorithm for large-scale mixed-size designs and achieves competitive results compared to a number of academic placers on the placement congestion constrained ISPD-2006 placement benchmarks.

An efficient and effective detailed placement algorithm

This work presents an efficient and effective detailed placement algorithm to handle the wirelength minimization problem and proposes an efficient single-segment clustering technique to optimally shift cells within a segment to minimize wirelength.

Can recursive bisection alone produce routable, placements?

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.

A fast hierarchical quadratic placement algorithm

The authors' new bottom-up clustering technique, called the best choice (BC), operates directly on a circuit hypergraph and repeatedly clusters the globally best pair of objects, and proposes a lazy-update technique for faster updates of the clustering score with almost no loss of the solution quality.

FAR: fixed-points addition & relaxation based placement

Experimental results indicate that to accommodate buffers in specific regions, FAR is able to perturb incrementally a given solution in awell-controlled way.

BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms

Details of the implementation of legalization of macros and standard cells uses minimum cost flow and dynamic programming algorithms and new experimental results are presented.

mPL6: enhanced multilevel mixed-size placement

The multilevel placement package mPL6 combines improved implementations of the global placer mPL5 (ISPD05) and the XDP legalizer and detailed placer (ASPDAC06). It consistently produces robust,

Effective free space management for cut-based placement via analytical constraint generation

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.

Capo: robust and scalable open-source min-cut floorplacer

The overall structure of Capo is surveyed, recent improvements are discussed and ongoing research is described, which describes recent improvements and describes ongoing research.

Fast floorplanning by look-ahead enabled recursive bipartitioning

For large floorplanning benchmarks, an implementation, called partitioning to optimize module arrangement (PATOMA), generates solutions with half the wirelength of state-of-the-art floorplanners in orders of magnitude less run time.