Timing Driven Placement for Large Standard Cell Circuits

@article{Swartz1995TimingDP,
  title={Timing Driven Placement for Large Standard Cell Circuits},
  author={William Swartz and Carl Sechen},
  journal={32nd Design Automation Conference},
  year={1995},
  pages={211-215}
}
We present an algorithm for accurately controlling delays during the placement of large standard cell integrated circuits. Previous approaches to timing driven placement could not handle circuits containing 20,000 or more cells and yielded placement qualities which were well short of the state of the art. Our timing optimization algorithm has been added to the placement algorithm which has yielded the best results ever reported on the full set of MCNC benchmark circuits, including a circuit… Expand
A Parallel Circuit-Partitioned Algorithm for Timing-Driven Standard Cell Placement
TLDR
The algorithm discussed in this paper, calledmpiPLACE, is circuit-partitioned and can handle arbitrarily large circuits on cluster-of-workstations-type parallel machines, such as the Intel Paragon and IBM SP-2. Expand
Effective heuristics for timing driven constructive placement
TLDR
This work believes that its work is the first to comprehensively address the issue of pad placement, and to study the effectiveness of using subsets of the paths in the circuit in timing driven placement. Expand
Timing-Driven Placement
TLDR
This chapter discusses fundamental algorithms as well as recent trends of timing-driven placement, and describes the basic ideas and fundamental techniques behind the path (or timing graph) based approach. Expand
A parallel circuit-partitioned algorithm for timing driven cell placement
  • J. Chandy, P. Banerjee
  • Computer Science
  • Proceedings International Conference on Computer Design VLSI in Computers and Processors
  • 1997
TLDR
The algorithm discussed in this paper is the first parallel algorithm for timing driven placement, which is circuit partitioned and can handle arbitrary large circuits on distributed memory multiprocessors. Expand
Timing-driven placement for FPGAs
TLDR
A new Simulated Annealing-based timing-driven placement algorithm for FPGAs is introduced that employs a novel method of determining source-sink connection delays during placement and introduces a new cost function that trades off between wire-use and critical path delay, resulting in significant reductions incritical path delay without significant increases in wire- use. Expand
Timing-driven placement for hierarchical programmable logic devices
TLDR
The algorithm follows the natural recursive k-way partitioning-based approach to placement on hierarchical PLD architectures and shows a substantial 38.5% average (36.3% median) improvement in register-to-register performance across a range of real designs in modern density ranges. Expand
Large-Scale Circuit Placement
TLDR
This chapter surveys modern techniques for circuit placement, with an emphasis on how placement interacts with logic synthesis and routing, and argues that the recent shift toward “multi-core” microprocessors is an extremely significant event. Expand
IPplacer: An Efficient 0-1 Integer Programming Based Placement for VLSI Circuits
TLDR
A novel 0-1 Integer Programming (0–1 IP) based lookahead legalization process has been proposed for global placement with the help of a new force-directed method to create regions in order to reduce the searching space forglobal placement. Expand
Timing and Congestion Driven Algorithms for FPGA Placement
TLDR
Novel timing and congestion driven placement algorithms for FPGAs with minimal runtime overhead are presented by predicting the post-routing timing-critical edges and estimating congestion accurately, able to simultaneously reduce the critical path delay and the minimum number of routing tracks. Expand
Algorithms to improve area density utilization, routability and timing during detailed placement and legalization of VLSI circuits
TLDR
The proposed cell spreading algorithm can improve the quality of placement in mixed placement flow in both industrial and academic environments and the restriction to optimize detailed placement in a legalized netlist can be relaxed. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
Efficient and effective placement for very large circuits
TLDR
Two major extensions to the implementation of simulated annealing for row-based placement are presented which have enabled it to obtain the best results ever reported for a large set of MCNC benchmark circuits while using the least computation timeEver reported for remotely comparable results. Expand
SPEED: fast and efficient timing driven placement
TLDR
A timing driven placement approach for very large circuits is described, and results of benchmark circuits with up to 25,000 cells show an excellent quality in terms of maximum path delay and total area after final routing. Expand
Efficient and effective placement for very large circuits
  • W. Sun, C. Sechen
  • Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1995
TLDR
A new hierarchical annealing-based placement program which yields total wire length reductions of up to 9% while consuming up to 7.5 times less CPU time in comparison to TimberWolfSC v6.0. Expand
Timing issues in cell-based VLSI design
TLDR
A new methodology and set of tools, which combine verification and predictive functions are proposed for the prediction of the critical paths prior to the physical design step, and several new polynomial zero-slack algorithms for the computation of timing constraints on all the interconnects are presented. Expand
Timing Influenced Layout Design
TLDR
This work presents a new approach to the automatic layout design for VLSI chips which incorporates timing information to influence the placement and wiring processes, and adds a third phase of timing to the hierarchy without affecting the computational complexity of the basic algorithm. Expand
A performance driven macro-cell placement algorithm
TLDR
A new performance driven macro-cell placement algorithm that will ensure that timing requirements between input and output signals are satisfied and improve the quality of the placement result. Expand
An analytic net weighting approach for performance optimization in circuit placement
  • R. Tsay, J. Koehl
  • Computer Science
  • 28th ACM/IEEE Design Automation Conference
  • 1991
TLDR
An efficient circuit placement approach based on analytic net weighting controls for nonlinear performance constraints and a quantitative analysis of the ef- fect ofNet weighting to wire length change is given. Expand
Timing driven placement in interaction with netlist transformations
TLDR
A new approach that performs timing driven placement for standard cell circuits in interaction with netlist transformations that exploits global dependencies between the signals in the circuit with excellent placement quality. Expand
An algorithm for performance-driven initial placement of small-cell ICs
  • A. Srinivasan
  • Computer Science
  • 28th ACM/IEEE Design Automation Conference
  • 1991
TLDR
An efficient algorithm for performance driven initial placement is developed and its finiteness proved under less stringent conditions than [JSKSO], and it does not require an initial feasible solution. Expand
Performance-Driven Placement of Cell Based IC's
  • M. Jackson, E. Kuh
  • Engineering, Computer Science
  • 26th ACM/IEEE Design Automation Conference
  • 1989
TLDR
A novel approach to performance-driven placement is presented, combining timing analysis and physical design to dynamically optimize the performance of the chip during placement. Expand
...
1
2
3
4
5
...