136,762 research outputs found
Cell replication and redundancy elimination during placement for cycle time optimization
This paper presents a new timing driven approach for cell replication tailored to the practical needs of standard cell layout design. Cell replication methods have been studied extensively in the context of generic partitioning problems. However, until now it has remained unclear what practical benefit can be obtained from this concept in a realistic environment for timing driven layout synthesis. Therefore, this paper presents a timing driven cell replication procedure, demonstrates its incorporation into a standard cell placement and routing tool and examines its benefit on the final circuit performance in comparison with conventional gate or transistor sizing techniques. Furthermore, we demonstrate that cell replication can deteriorate the stuck-at fault testability of circuits and show that stuck-at redundancy elimination must be integrated into the placement procedure. Experimental results demonstrate the usefulness of the proposed methodology and suggest that cell replication should be an integral part of the physical design flow complementing traditional gate sizing techniques
Tight coupling of timing driven placement and retiming
Retiming is a widely investigated technique for performance optimization. In general, it performs extensive modifications on a circuit netlist, leaving it unclear, whether the achieved performance improvement will still be valid after placement has been performed. This paper presents an approach for integrating retiming into a timing-driven placement environment. The experimental results show the benefit of the proposed approach on circuit performance in comparison with design flows using retiming only as a pre- or postplacement optimization method
Timing-Driven Macro Placement
Placement is an important step in the process of finding physical layouts for electronic computer chips. The basic task during placement is to arrange the building blocks of the chip, the circuits, disjointly within a given chip area. Furthermore, such positions should result in short circuit interconnections which can be routed easily and which ensure all signals arrive in time. This dissertation mostly focuses on macros, the largest circuits on a chip. In order to optimize timing characteristics during macro placement, we propose a new optimistic timing model based on geometric distance constraints. This model can be computed and evaluated efficiently in order to predict timing traits accurately in practice. Packing rectangles disjointly remains strongly NP-hard under slack maximization in our timing model. Despite of this we develop an exact, linear time algorithm for special cases. The proposed timing model is incorporated into BonnMacro, the macro placement component of the BonnTools physical design optimization suite developed at the Research Institute for Discrete Mathematics. Using efficient formulations as mixed-integer programs we can legalize macros locally while optimizing timing. This results in the first timing-aware macro placement tool. In addition, we provide multiple enhancements for the partitioning-based standard circuit placement algorithm BonnPlace. We find a model of partitioning as minimum-cost flow problem that is provably as small as possible using which we can avoid running time intensive instances. Moreover we propose the new global placement flow Self-Stabilizing BonnPlace. This approach combines BonnPlace with a force-directed placement framework. It provides the flexibility to optimize the two involved objectives, routability and timing, directly during placement. The performance of our placement tools is confirmed on a large variety of academic benchmarks as well as real-world designs provided by our industrial partner IBM. We reduce running time of partitioning significantly and demonstrate that Self-Stabilizing BonnPlace finds easily routable placements for challenging designs – even when simultaneously optimizing timing objectives. BonnMacro and Self-Stabilizing BonnPlace can be combined to the first timing-driven mixed-size placement flow. This combination often finds placements with competitive timing traits and even outperforms solutions that have been determined manually by experienced designers
Placement driven retiming with a coupled edge timing model
Retiming is a widely investigated technique for performance optimization. It performs powerful modifications on a circuit netlist. However, often it is not clear, whether the predicted performance improvement will still be valid after placement has been performed. This paper presents a new retiming algorithm using a highly accurate timing model taking into account the effect of retiming on capacitive loads of single wires as well as fanout systems. We propose the integration of retiming into a timing-driven standard cell placement environment based on simulated annealing. Retiming is used as an optimization technique throughout the whole placement process. The experimental results show the benefit of the proposed approach. In comparison with the conventional design flow based on standard FEAS our approach achieved an improvement in cycle time of up to 34% and 17% on the average
Recommended from our members
Nanometer VLSI placement and optimization for multi-objective design closure
In a VLSI physical synthesis flow, placement directly defines the interconnection,
which affects many other design objectives, such as timing, power consumption,
congestion, and thermal issues. With the scaling of technology, the relative interconnect
delay increases dramatically. As a result, placement has become a bottleneck
in deep sub-micron physical synthesis. In this dissertation, I propose several
optimization algorithms from global placement, placement migration, timing driven
placements, to incremental power optimizations for multi-objective VLSI design
closure. The first work is DPlace, a new global placement algorithm that scales
well to the modern large-scale circuit placement problems. DPlace simulates the
natural diffusion process to spread cells smoothly over the placement region, and
uses both analytical and discrete techniques to improve the wire length. However,
global placement is never sufficient for multi-objective design closure, a variety of
design objectives have to be improved incrementally, such as timing, routing congestion,
signal integrity, and heat distribution. Placement migration is a critical step
to address the cell overlaps appearing during incremental optimizations. To achieve
high placement stability, I propose a computational geometry based placement migration
flow to cope with placement changes, and a new stability metric to measure
the “similarity” between two placements accurately. Our placement migration algorithm
has clear advantage over conventional legalization algorithms such that the
neighborhood characteristics of the original placement are preserved. For timing
closure in high performance designs, I present a linear programming based incremental
timing driven placement to improve the timing on critical paths directly.
I further present an efficient timing driven placement algorithm (Pyramids). Two
formulations of Pyramids are proposed, which are suitable for different optimization
stages in a physical synthesis flow. Both approaches find the optimal location
for timing of a cell in constant time, through computational geometry based approaches.
For fast convergence of design closure, placement should be integrated
with other optimization techniques. I propose to combine placement, gate sizing
and Vt swapping techniques to reduce the total power consumption, especially the
leakage power, which is becoming increasingly critical for nanometer VLSI design
closure.Electrical and Computer Engineerin
Cycle time optimization by timing driven placement with simultaneous netlist transformations
We present new concepts to integrate logic synthesis and physical design. Our methodology uses general Boolean transformations as known from technology-independent synthesis, and a recursive bi-partitioning placement algorithm. In each partitioning step, the precision of the layout data increases. This allows effective guidance of the logic synthesis operations for cycle time optimization. An additional advantage of our approach is that no complicated layout corrections are needed when the netlist is changed
Incremental Timing-Driven Placement with Displacement Constraint
In the modern deep-submicron Very Large Integrated Circuit(VLSI) design flow intercon-
nect delays are becoming major limiting factor for timing closure. Traditional placement
algorithms such as routability-driven placement (improves routability) and wirelength-
driven placement (reduces total wirelength) are no longer sufficient to close timing. To
this end, timing-driven placement plays a crucial role in reducing the interconnect delay
through timing critical paths (paths with timing violations/negative slacks) of the design
and thereby achieving specific performance/clock frequency.
In the placement flow, timing information about the design can be incorporated during
global placement and/or incremental/detailed placement. Although, over the years, there
has been significant advances in the quality of the global placement, there is a growing need
for high performance incremental timing-driven placement due to the lack of accurate
interconnect information during global placement. Moreover, incremental timing-driven
placement is essential to recover timing while preserving the other optimization objectives
such as total wirelength, routing congestion, and so forth which are optimized at the early
stages of the design flow.
This thesis proposes a simple, yet efficient, incremental timing-driven placement algo-
rithm that seeks to find optimized locations for standard cells so that the total negative
slack of the design can be maximized. Our algorithm consists two stages: (1) Global Move
which positions standard cells inside a critical bounding box to eliminate timing violations
on timing critical nets; and (2) Local Move which provides further timing improvement by
finely adjusting the current locations of the standard cells within a local region.
We evaluate our algorithm using ICCAD-2014 timing-driven placement contest bench-
marks. The results show that, on average, our technique eliminates 94% and 30% of the
late and early total negative slacks, respectively, and, 82% and 27% of the late and early
worst negative slacks, respectively, under short and long displacement constraints. The
1st-place team of the contest improves late and early total negative slacks by 90% and
39%, respectively, and improves late and early worst negative slack by 76% and 32%, re-
spectively. Taking into account both timing violation improvement and the placement
quality (i.e., other objectives), on average, we outperform the 1st-place team by 3% in
terms of the ICCAD-2014 contest quality score and our technique is 4.6Ă— faster in terms
of runtime
Timing driven genetic placement
IN this paper we present a timing driven placer for standard cell IC design. The placement algorithm follows the genetic paradigm, with the objective of minimizing both area and path slacks. At early generations, the search is biased toward solutions with superior timing characteristics. As the algorithm starts converging towards generations with acceptable delay properties, the objective is dynamically adjusted toward optimizing area and routability. Experiments with benchmark test demonstrate delay performance improvement by up to 20%. It is also shown that sizeable reduction in runtime is obtained when population size is allowed to decrease in a controlled manner whenever the search his a plateau. This reduction in runtime is achieved without any noticeable loss in solution quality
Timing Driven Genetic Algorithm for Placement
In this paper we present a timing -driven placer for standard-cell IC design. The placement algorithm follows the genetic pradigm. At early generations, the search is biased towards solutions with superior timing characteristics. As the algorithm starts converging towards generations with acceptable delay properties, the objective is dynamically adjusted towards optimizing area and routability. Experiments with test circuits demonstrate delay performance improvement by upto 20%. Without any noticeable loss in solution quality, sizebale reduction in runtime is obtained when population size is allowed to decrease in a controlled manner whenever the search hits a plateau
- …