Timing-driven placement based on monotone cell ordering constraints

  title={Timing-driven placement based on monotone cell ordering constraints},
  author={Chanseok Hwang and Massoud Pedram},
  journal={Asia and South Pacific Conference on Design Automation, 2006.},
  pages={6 pp.-}
In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed that most of the paths that cause timing problems in the circuit meander outside the minimum bounding box of the start and end nodes of the path. To limit this undesirable behavior, we impose a physical constraint on the placement problem, i.e., we assign a preferred signal direction to each critical path in the circuit… Expand
Standard cell placement is a NP complete open problem. The main objectives of a placement algorithm are to minimize chip area and the total wire length of all the nets. Due to interconnect dominance,Expand
Net weighing based timing driven standard cell placer
A timing driven placement engine which is based on the partition driven method and based on net weighting, half Perimeter obtained by the proposed placer for the benchmark designs are comparable to the industry standard tool Amoeba. Expand
TSV-based 3D-IC placement for timing optimization
This paper proposed a methodology on cell placement by applying min-cut partitioning in one layer after layer assignment and address alignment constraint simultaneously and showed that both the wirelengths and the delay of critical paths in 3DICs are much superior compare to 2D ICs. Expand
In Deep Sub Micron (DSM) technologies, circuits fail to meet the timings estimated during synthesis after completion of the layout which is termed as ‘Timing Closure’ problem. This work focuses onExpand
Keeping Physical Synthesis Safe and Sound
Physical synthesis is a relatively young field in Electronic Design Automation. Many published optimizations for physical synthesis and timing-driven placement end up hurting the final result, oftenExpand
Safe Delay Optimization for Physical Synthesis
SafeResynth is proposed, a safe resynthesis technique, which provides immediately-measurable delay improvement without altering the design's functionality, and can enhance circuit timing without detrimental effects on route length and congestion. Expand
SafeResynth: A new technique for physical synthesis
This work defines and explores the concept of physical safeness and evaluates empirically its impact on route length, via count and timing, and proposes a new physically safe and logically sound optimization, called SafeResynth, which provides immediately measurable improvements without altering the design's functionality. Expand
Sleep transistor distribution in row-based MTCMOS designs
An optimal algorithm for linearly placing the allocated sleep transistors on each standard cell row so as to minimize the performance degradation of the MTCMOS circuit, which is in part due to unwanted voltage drops on its virtual ground network. Expand
Algorithms for wire length improvement of VLSI circuits with concern to critical paths
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 RESUMO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
Techniques for VLSI Circuit Optimization Considering Process Variations


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. Expand
Timing driven placement using physical net constraints
  • B. Halpin, C. Chen, N. Sehgal
  • Computer Science
  • Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
  • 2001
This paper presents a new timing driven placement algorithm that explicitly meets physical net lengths constraints. It is the first recursive bi-section placement (RBP) algorithm that meets preciseExpand
A performance-driven standard-cell placer based on a modified force-directed algorithm
A performance-driven cell placement method based on a modified force-directed approach with the introduction of pseudo net, which significantly improves the layout quality and CPU time consumption and is integrated into an industrial APR flow. Expand
Timing driven force directed placement with physical net constraints
This work suggests that the force directed method with net constraints is a powerful tool for placement and timing convergence, achieving an average worst negative slack optimized exploitation of 64% and average total negative slack optimization exploitation of 48% results on 16 industry circuits from a 1.5GHz microprocessor. Expand
FastPlace: efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model
FastPlace-a fast, iterative, flat placement algorithm for large-scale standard cell designs based on the quadratic placement approach that produces a global placement with even cell distribution in a very short time and a hybrid net model that is a combination of the traditional clique and star models. Expand
An Approach to Placement-Coupled Logic Replication
The authors build on the replication tree idea and enhance the timing-driven fanin tree embedding algorithm to optimize subcritical paths, yielding even better delay improvements. Expand
Performance driven multiway partitioning
  • J. Cong, S. Lim
  • Computer Science
  • Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106)
  • 2000
A new performance driven formulation for cell move based top-down multiway partitioning algorithms with consideration of the local and global interconnect delay and acyclic constraints to give partitioners capability of minimizing cutsize and delay is provided. Expand
Force directed mongrel with physical net constraints
A new force directed global placement algorithm that exploits and extends techniques from two leading placers, Force-directed and Mongrel, to significantly improve the quality of placement during the difficult overlap removal stage of global placement. Expand
Timing-driven placement using design hierarchy guided constraint generation
A novel slack assignment approach is described as well as its application on delay budgeting with design hierarchy information, and the proposed timing-driven placement flow is implemented into a placement tool named Dragon (timing-driven mode), and evaluated using an industrial place and route flow. Expand
Min-max placement for large-scale timing optimization
This work introduces a novel minimization of maximal path delay that improves upon previously known algorithms for timing-driven placement and has provable properties and are fast in practice. Expand