Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20010047507 A1
Publication typeApplication
Application numberUS 09/096,804
Publication dateNov 29, 2001
Filing dateJun 12, 1998
Priority dateJun 12, 1998
Also published asUS6385760
Publication number09096804, 096804, US 2001/0047507 A1, US 2001/047507 A1, US 20010047507 A1, US 20010047507A1, US 2001047507 A1, US 2001047507A1, US-A1-20010047507, US-A1-2001047507, US2001/0047507A1, US2001/047507A1, US20010047507 A1, US20010047507A1, US2001047507 A1, US2001047507A1
InventorsLawrence Pileggi, Majid Sarrafzadeh, Gary K. Yeap, Feroze Peshotan Taraporevala, Tong Gao, Douglas B. Boyle
Original AssigneeLawrence Pileggi, Majid Sarrafzadeh, Gary K. Yeap, Feroze Peshotan Taraporevala, Tong Gao, Douglas B. Boyle
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
System and method for concurrent placement of gates and associated wiring
US 20010047507 A1
Abstract
A design tool for integrated circuits includes a placement tool which places logic gates and interconnect components concurrently. Probabilistic interconnect models are used to represent the collection of possible interconnect routings that provide acceptable circuit performance and routing area.
Images(3)
Previous page
Next page
Claims(16)
I claim:
1. A method for placing circuit elements onto a target area of a semiconductor substrate, comprising:
providing an initial placement of said circuit elements onto said target area;
providing, for each of a plurality of selected nets interconnecting said circuit elements, a probabilistic model of interconnect wiring;
providing a second placement of said circuit elements by reassigning selected ones of said circuit elements; and
updating said probabilistic model of interconnect wiring for each of said selected ones of said circuit elements, according to said second placement.
2. A method as in
claim 1
, wherein said second placement being provided in accordance with timing estimates of said probabilistic model.
3. A method as in
claim 2
, wherein said probabilistic model represents local wiring density.
4. A method as in
claim 1
, wherein said probabilistic model is provided independently of said initial and second placements.
5. A method as in
claim 1
, wherein said initial placement, circuit elements are placed within bins, and wherein said probabilistic models are provided for interconnect wiring between circuit elements of different bins.
6. A method as in
claim 5
, wherein a statistical routing estimate is provided for a signal path between circuit elements within the same bin.
7. A method as in
claim 5
, wherein said bins are subdivided into successively smaller bins and wherein said steps of providing a second placement and adjusting the probabilistic models are repeated for said successively smaller bins.
8. A method as in
claim 7
, further comprising, when said smaller bins reach a predetermined size, transforming each of said probabilistic model into an actual interconnect wiring.
9. A system for placing circuit elements onto a target area of a semiconductor substrate, comprising:
a placement tool for placing an initial placement of said circuit elements onto said target area; and
means for providing, for each of a plurality of selected nets interconnecting said circuit elements, a probabilistic model of interconnect wiring; wherein
said placement tool, upon completion by said means for providing of said probabilistic model, provides a second placement of said circuit elements by reassigning selected ones of said circuit elements; and thereupon, said means for providing a probabilistic model updates said probabilistic model of interconnect wiring for each of said selected ones of said circuit elements, according to said second placement.
10. A system as in
claim 9
, wherein said second placement being provided in accordance with timing estimates of said probabilistic model.
11. A system as in
claim 9
, wherein said probabilistic model represents local wiring density.
12. A system as in
claim 9
, wherein said probabilistic model is provided independently of said initial and second placements.
13. A system as in
claim 9
, wherein said placement tool places said circuit elements within bins, and wherein said probabilistic models are provided for interconnect wiring between circuit elements of different bins.
14. A system as in
claim 13
, wherein a statistical routing estimate is provided for a signal path between circuit elements within the same bin.
15. A system as in
claim 13
, wherein said bins are subdivided into successively smaller bins and wherein said steps of providing a second placement and adjusting the probabilistic models are repeated for said successively smaller bins.
16. A system as in
claim 15
, further comprising, when said smaller bins reach a predetermined size, transforming each of said probabilistic model into an actual interconnect wiring.
Description
BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to integrated circuit design tools. In particular, the present invention relates to design tools that optimize area and performance for integrated circuits.

[0003] 2. Discussion of the Related Art

[0004] The interconnection wiring (“interconnect”) among circuit elements in an integrated circuit is expected to dominate signal delays and to limit achievable circuit density of an integrated circuit. Existing design methods, which treat interconnect as “parasitics” and focus on optimizing transistors and logic gates, are ill-equipped to provide a design which delivers the necessary performance. Typically, in a conventional design method, the circuit elements of an integrated circuit are first synthesized and placed. A global routing tool is then used to interconnect these circuit elements. Because placement and routing are performed relatively independently, even though some tools take into consideration the connectivity among circuit elements in providing the placement, the global routing tool's ability to address power, timing and congestion issues is severely limited.

[0005] Concurrent placement and wiring routing is disclosed in U.S. Pat. No. 4,593,363, entitled “Simultaneous Placement and Wiring for VLSI Chips” to Burstein et al. The '363 patent discloses an iterative method in which a global router is invoked to route networks redistributed under a hierarchical placement algorithm.

SUMMARY OF THE INVENTION

[0006] The present invention provides a method and a design tool for designing integrated circuits with emphasis on circuit performance. One method of the present invention pertains to a placement algorithm for placing circuit elements onto a target area of a semiconductor substrate according to the following steps: (a) providing an initial placement of the circuit elements onto a target area; (b) providing, for each of the nets interconnecting the circuit elements, a probabilistic model of interconnect wiring based on required performance for the net; (c) optimizing the cost function associated with the placement of the circuit elements and the corresponding wiring using an iterative placement algorithm; (d) updating the performance estimations during placement to facilitate continuous adjustments of the probabilistic wiring model. Thus, in a method of the present invention, the probabilistic model of interconnect wiring are provided according to performance requirements which are updated continuously.

[0007] The placement tool optimizes gate placement using timing estimates based on a probabilistic wiring model. The wiring model represents the local, probabilistic wiring density based on the continuously updated criticality of the net. The probabilistic wiring model represents nets based on where the wiring should be routed to attain the necessary performance. The placement optimization then modifies the placement to achieve aggregate wiring that is globally feasible. The present invention can be practiced in conjunction with any placement tool which is based on iterative improvement.

BRIEF DESCRIPTION OF THE DRAWINGS

[0008]FIG. 1 is a flow diagram of a method of optimizing integrated circuit performance, in accordance with the present invention.

[0009]FIG. 2a provides an example of a smear over a bounding box 600 of a net.

[0010]FIG. 2b provides a smear of the net of FIG. 2a, provided over localized bounding regions 601.

[0011]FIG. 2c provides a smear of the net of FIG. 2a, provided over localized bounding regions 601, but with multiple wire-smearing densities shown at areas 603 and 604.

[0012]FIGS. 3a and 3 b show equally acceptable (from a performance point of view) wiring configurations 503 and 504 for interconnecting gates 501 and 502.

[0013]FIG. 3c shows a probabilistic smear 505 representing equally acceptable wiring configurations between and including wiring configurations 503 and 504.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0014] The present invention provides a method that performs placement of circuit elements (e.g. gates) and interconnect wiring concurrently. To ensure that routing space is not unduly restricted before placement is finalized, the router of the present invention places interconnect wires (“interconnect”) using a probabilistic representation (“smear”), rather than actual wiring, until predetermined points in the optimization process.

[0015] The present invention can be applied to an integrated circuit design system, such as any of those disclosed in copending patent applications (“Copending Applications”): (a) a patent application, entitled “Performance Driven Design Optimization Using Logical and Physical Information” by D. Boyle et al., Ser. No. 09/021,973, filed Feb. 11, 1998, and (b) a patent application, entitled “Method for Design Optimization Using Logical and Physical Information,” by L. Pileggi et al., Ser. No. ______, filed on or about the same day as the present application. Both Copending Applications are assigned to Monterey Design Systems, Inc., which is also the Assignee of the present application. The disclosures of the Copending Applications are hereby incorporated by reference in their entireties.

[0016]FIG. 1 is a flow diagram of a method for optimizing integrated circuit performance in accordance with the present invention. The method operates on an input net list (e.g., a logic gate-level net list synthesized from a behavioral description of an integrated circuit or a portion of an integrated circuit), from which circuit elements are clustered according to connectivity. At step 1 of FIG. 1, the clusters are mapped as an initial placement onto a 2-dimensional representation of the chip area. Any placement algorithm which is capable of placing non-uniform circuit elements can be used for the initial placement.

[0017] At step 2, having mapped all circuit elements to individual 2-dimensional locations of the chip, each net wire placement is modeled in a probabilistic manner. At this step, all nets are considered equally critical. Each probabilistic wire placement (“smear”) represents a set of best routes of minimum or close to minimum cost (e.g., interconnect delay). The smear can be represented, as shown in FIG. 6a, by the average routing length for a predetermined number of best routes over a bounding box (i.e., bounding box 600) covering the net. Alternately, and more accurately, a smear for a net can be represented (as shown in FIG. 2b) by the average interconnect length of the best routes averaged over relevant localized bounding regions indicated by shaded regions 601. The representation for the smear can be further refined, if necessary, to allow regions where more favorable routes are achievable to be identified. For example, FIG. 2c shows a smear representing the net of FIG. 2a, including areas 603 and 604 of different wiring densities. The darker shadings (i.e., areas 604) indicate regions where more favorable routes can be achieved.

[0018] At step 3, using the initial placement of the circuit elements and the smears, the delays for the nets and associated circuit elements are calculated. Since the smears are probabilistic, the delays calculated from the smears are necessarily probabilistic. In one embodiment, both the best case delay and the worst case delay are approximated over each smear.

[0019] Depending on the placement algorithm and the circuit element clusters, a statistical estimate of delay is provided for each net within a cluster. Such a statistical estimate of delay can be provided, for example, based on the fan-out at a driver of the net. A delay based on estimates of the resistance and the capacitance in a net (“RC calculations”) can be provided for a net between circuit elements of different clusters. Where a net has a non-negligible portion of delay within a cluster and a non-negligible portion of delay between clusters, an estimate based on both the statistical estimate of delay and the RC calculations can be provided.

[0020] In this embodiment, the expected performance at each net is represented by a “slack graph”. A slack graph includes, for each net, a “slack” value which is represented by the time difference between the arrival time and the required time of a signal on the net. The propagation delay of any logic gate can be estimated by conventional techniques, such as using Thevenin equivalent or effective load (Ceff) models.

[0021] At step 4, each net which lies along a critical path and which has either a negative slack or a small positive slack is identified. Since it is advantageous to minimize the delays in these nets, the smears of these nets are restricted to encompass only those routes producing the minimum delay, or close to minimum delay.

[0022] Even though the nets along a critical path are most constrained in wiring placement, a smear of one of these nets still represents a set of routes of best performance. FIGS. 3a, 3 b and 3 c show equally acceptable (from a performance point of view) wiring routes 503 and 504 for interconnecting gates 501 and 502. Routes between routes 503 and 504 are also acceptable. (As shown, routes 503 and 504 are preferred routes, since any route between routes 503 and 504 incurs at least one additional via). Hence, a smear indicated by bounding box 505 represents the collection of best acceptable routes between and including routes 503 and 504, assuming via costs are negligible.

[0023] At step 5, an iterative placement algorithm based on minimizing a cost function is invoked. In this embodiment, the cost function has congestion, gate area, total wiring, power and delay components. One example of a suitable placement algorithm is the Fidduccia-Matheyses (FM) algorithm known in the art. Another example is any placement algorithm based on simulated annealing.

[0024] According to the present invention, smears associated with a circuit element are concurrently placed when the circuit element is placed. With each iterative placement move (step 5 a), smears are derived based on existing slack information and the location change of the each circuit element involved in the iterative move. The delays and smears of each net are further refined in steps 5 b and 5 c. Specifically, at step 5 b, the delays and slacks are incrementally updated. Then, at step 5 c, the smears are updated based on the changes in slacks and circuit element placements.

[0025] In step 5 d, a decision is made as to whether or not to keep the iterative placement move, according to the cost function and the acceptance criteria for the move. Typically, not only moves which improve the cost are accepted. For example, in simulated annealing-based algorithms, some uphill cost moves are accepted to avoid local minima, so as to achieve better global solutions.

[0026] As mentioned above, a “smear” represents a collection of best possible routes of less than a predetermined cost. One representation of a smear, referred to as a “bounding box smear” or a “localized bounding box smear”, provides a wiring density calculated from a set of best routes over the associated area. The wiring density can be used to provide the congestion component of an overall cost function. The bounding box also provides a measure of the total interconnect wiring lengths, which can be used to estimate the total load capacitance driven by a driving circuit element, and hence the power dissipation of the driving circuit element. With wiring density and total interconnect wiring lengths, the bounding box smear thus estimates the integrated circuit area necessary for implementing the interconnect represented by the smear that achieves the required timing performance.

[0027] Since the wiring density is determined without regard to the smears associated with other circuit elements, the present invention provides a congestion measure that is based on the preferable position of the wire, rather than the constrained maximized route attached to a particular placement of the circuit elements to which the wire is associated. For a given location, the local wiring density, and hence congestion, is the sum of all smears at the location. During an iterative placement move, a gate and nets associated with the gate can be moved to reduce the local wiring density. A new smear is then calculated for each net at the new gate location. If the net has a large positive slack (i.e., the arrival time is much earlier than the required time), higher delay routes can be included in the smear. Conversely, where the placement of additional smears increase the congestion at a particular location, the cost estimate (e.g., the slack) on each net related to the smears at the location should be updated. In the present embodiment, an update to a slack is provided only after the cost difference exceeds a predetermined threshold.

[0028] The placement cost function considers a combination of the costs associated with area, power dissipation, delay, total wirelength, and wiring congestion. Placement moves are accepted or rejected based on changes in these costs. If a placement move is accepted (5 d), the placement algorithm returns to step 5 a. If the placement move is not accepted, the algorithm undoes the changes and executes step 5 a to obtain a new placement move.

[0029] The above detailed description is provided to illustrate the specific embodiments above and is not intended to be limiting of the present invention. Numerous variations and modifications within the scope of the present invention are possible. For example, the present invention is applicable to not only to design of logic circuits with conventional signaling on conventional interconnects, but to design of other circuit technologies also, such as high speed mixed mode signals on RF transmission lines, or circuits using copper interconnect. The present invention can also provide a system useful not only in the design of electronic integrated circuits, but also to micromachine with a significant electronic circuit portions. The present invention is set forth in the following claims.

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US6415422 *Sep 17, 1999Jul 2, 2002International Business Machines CorporationMethod and system for performing capacitance estimations on an integrated circuit design routed by a global routing tool
US6507937 *Jun 19, 2001Jan 14, 2003Lsi Logic CorporationMethod of global placement of control cells and hardmac pins in a datapath macro for an integrated circuit design
US6601222 *Oct 13, 2000Jul 29, 2003International Business Machines CorporationCoupled noise estimation and avoidance of noise-failure using global routing information
US6640331 *Nov 29, 2001Oct 28, 2003Sun Microsystems, Inc.Decoupling capacitor assignment technique with respect to leakage power
US7072815 *Aug 6, 2002Jul 4, 2006Xilinx, Inc.Relocation of components for post-placement optimization
US7107564 *Jan 31, 2002Sep 12, 2006Cadence Design Systems, Inc.Method and apparatus for routing a set of nets
US7191417 *Jun 4, 2004Mar 13, 2007Sierra Design Automation, Inc.Method and apparatus for optimization of digital integrated circuits using detection of bottlenecks
US7356781Jun 5, 2003Apr 8, 2008Infineon Technologies AgMethod for modifying design data for the production of a component and corresponding units
US7681165 *Aug 29, 2006Mar 16, 2010Altera CorporationApparatus and methods for congestion estimation and optimization for computer-aided design software
US7934189Jan 25, 2008Apr 26, 2011Infineon Technologies AgMethod of making an integrated circuit including simplifying metal shapes
US7962878Feb 26, 2008Jun 14, 2011Infineon Technologies AgMethod of making an integrated circuit using pre-defined interconnect wiring
US8370783 *Dec 3, 2007Feb 5, 2013Kabushiki Kaisha ToshibaSystems and methods for probabilistic interconnect planning
US8607183Jan 20, 2011Dec 10, 2013Infineon Technologies AgMethod of making in an integrated circuit including simplifying metal shapes
Classifications
U.S. Classification716/123
International ClassificationG06F17/50
Cooperative ClassificationG06F17/5072
European ClassificationG06F17/50L1
Legal Events
DateCodeEventDescription
Oct 9, 2013FPAYFee payment
Year of fee payment: 12
Nov 9, 2009FPAYFee payment
Year of fee payment: 8
Oct 22, 2005FPAYFee payment
Year of fee payment: 4
Oct 25, 2004ASAssignment
Owner name: SYNOPSYS, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MONTEREY DESIGN SYSTEMS, INC.;REEL/FRAME:015279/0811
Effective date: 20041022
Owner name: SYNOPSYS, INC. 700 E. MIDDLEFIELD RD.MOUNTAIN VIEW
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MONTEREY DESIGN SYSTEMS, INC. /AR;REEL/FRAME:015279/0811
Sep 29, 1998ASAssignment
Owner name: MONTEREY DESIGN SYSTEMS, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PILEGGI, LAWRENCE;SARRAFZADEH, MAJID;YEAP, GARY K.;AND OTHERS;REEL/FRAME:009482/0944;SIGNING DATES FROM 19980831 TO 19980921