Timing Driven Force Directed Placement Flow
First Claim
1. A method comprising:
- determining a particular net requiring buffering from among a plurality of nets of a circuit description;
decomposing a resource into a set of primitives of a structured array architecture; and
allocating at least some of the set of primitives to the particular net.
3 Assignments
0 Petitions
Accused Products
Abstract
Techniques for placement of integrated circuit elements include global placement, detailed placement, timing closure, and routing. The integrated circuit is described by a netlist specifying interconnections of morphable devices. The detailed placement uses, for example, Simultaneous Dynamical Integration, wherein the morphable-devices correspond to nodes influenced by forces, including timing forces. The timing forces are derived, for example, from a timing graph; path delay; slack; and drive resistance of the elements. The timing closure uses timing-driven buffering and timing-driven resizing to reduce maximum delay and/or transition time, and/or to fix hold time. Nets having high capacitance and/or fanout, and timing critical nets are preferentially processed. Timing-driven buffering applies buffering solutions to segments of route trees, combines solutions of adjoining segments, and prunes sets of solutions. Timing-driven resizing morphably replaces selected elements with upsized versions thereof.
128 Citations
1 Claim
-
1. A method comprising:
-
determining a particular net requiring buffering from among a plurality of nets of a circuit description; decomposing a resource into a set of primitives of a structured array architecture; and allocating at least some of the set of primitives to the particular net.
-
Specification