TIMING DRIVEN ROUTING IN INTEGRATED CIRCUIT DESIGN

• US 20120284683A1
• Filed: 05/06/2011
• Published: 11/08/2012
• Est. Priority Date: 05/06/2011
• Status: Active Grant

• Current Assignee: Globalfoundries US Incorporated (GlobalFoundries, Inc.)
• Original Assignee: International Business Machines Corporation
• Inventors: Alpert, Charles Jay, Li, Zhuo, Quay, Stephen Thomas, Zhou, Ying
• Granted Patent: US 8,386,985 B2
• Time in Patent Office: Days
• US Class Current: 716/129
• CPC Class Codes: G06F 2119/12 Timing analysis or timing optimisation
• CPC Class Codes: G06F 30/3312 Timing analysis
• CPC Class Codes: G06F 30/394 Routing G06F30/396 takes precedence
• CPC Class Codes: G06F 30/3947 global

Abstract

A method, system, and computer program product for timing driven routing in a design of an integrated circuit (IC) are provided in the illustrative embodiments. A router application executing in a data processing system performs a pre-global routing optimization of the design. A plurality of wirelength target constraints are set on a plurality of subsets of a set of nets in the design. Global routing is performed on the design. The design is adjusted using wires placed in the design during the global routing. A priority is assigned to each net in the set of nets. Detailed routing is performed on the design.

Claims

1. A computer implemented method for timing driven routing in a design of an integrated circuit (IC), the method comprising:

performing, using a router application executing in a data processing system, a pre-global routing optimization of the design;

setting a plurality of wirelength target constraints on a plurality of subsets of a set of nets in the design;

performing global routing on the design;

adjusting the design using wires placed in the design during the global routing;

assigning a priority to each net in the set of nets; and

performing detailed routing on the design.

2. The computer implemented method of claim 1, wherein the design is an design obtained after a placement operation, wherein the pre-global routing optimization produces a pre-global routing optimized design, wherein setting the plurality of wirelength target constraints uses the pre-global routing optimized design, wherein the global routing uses the pre-global routing optimized design and the plurality of wirelength target constraints to produce a global routed design, wherein the adjusting uses the global routed design to produce an adjusted global routed design, and wherein the detailed routing uses the adjusted global routed design and the priority associated with each net in the set of nets to produce a detailed routed design.

3. The computer implemented method of claim 1, wherein performing the pre-global routing optimization further comprises:

performing a pin density spreading operation on the design;

selecting a net from the set of nets whose timing characteristic has exceeded a threshold responsive to the pin density spreading operation; and

adjusting the timing characteristic of the net in-place such that a cell to which the net belongs does not change position.

4. The computer implemented method of claim 3, wherein adjusting the timing characteristic of the net the in-place is accomplished using one of (i) threshold voltage tuning, and (ii) gate resizing, further comprising:

performing a second global routing on the design including a change from the adjusting;

determining, following the second global routing, whether the design has deteriorated responsive to the change; and

undoing the change.

5. The computer implemented method of claim 1, wherein the setting the plurality of wirelength target constraints further comprises:

categorizing into a plurality of categories, each net in the set of nets according to a timing criticality and a wirelength associated with each net; and

associating with each category in the plurality of categories a wirelength target constraint.

6. The computer implemented method of claim 5, wherein setting the plurality of wirelength target constraints further comprises:

assigning, to a net whose wirelength in the design is less than a threshold wirelength, a wirelength target constraint that is more stringent as compared to a second wirelength target constraint assigned to a second net whose wirelength in the design is more than the threshold wirelength; and

assigning, to a third net whose slack is smaller than a slack threshold, a third wirelength target constraint that is more stringent as compared to a fourth wirelength target constraint assigned to a fourth net when the third net is more timing critical than the fourth net.

7. The computer implemented method of claim 1, wherein the adjusting the design using the wires placed in the design during global routing further comprises:

selecting, following the global routing, a net from the set of nets whose timing characteristic exceeds a threshold; and

performing, causing a change in the design, a timing optimization on the net using a subset of the wires placed in the design during the global routing.

8. The computer implemented method of claim 7, further comprising:

performing a second global routing;

determining, following the second global routing, whether the design has deteriorated responsive to the change; and

undoing the change.

9. The computer implemented method of claim 1, wherein assigning the priority further comprises:

categorizing into a plurality of categories, the nets in the set of nets according to a wirelength of each net;

adjusting a timing characteristic of each net in a category from the plurality of categories;

measuring a slew rate of each net in the category;

sorting the nets within the category according to each net'"'"'s slew rate, forming a sorted order of nets; and

assigning a priority to each net in the category according to the net'"'"'s position in the sorted order of nets.

10. The computer implemented method of claim 9, wherein a priority assigned to a net in the set of nets is used during a subsequent routing, and wherein a first net with a higher priority as compared to a priority of a second net is routed before the second net.

11. A computer usable program product comprising a computer usable storage medium including computer usable code for timing driven routing in a design of an integrated circuit (IC), the computer usable code comprising:

computer usable code for performing, using a router application executing in a data processing system, a pre-global routing optimization of the design;

computer usable code for setting a plurality of wirelength target constraints on a plurality of subsets of a set of nets in the design;

computer usable code for performing global routing on the design;

computer usable code for adjusting the design using wires placed in the design during the global routing;

computer usable code for assigning a priority to each net in the set of nets; and

computer usable code for performing detailed routing on the design.

12. The computer usable program product of claim 11, wherein the design is an design obtained after a placement operation, wherein the pre-global routing optimization produces a pre-global routing optimized design, wherein setting the plurality of wirelength target constraints uses the pre-global routing optimized design, wherein the global routing uses the pre-global routing optimized design and the plurality of wirelength target constraints to produce a global routed design, wherein the adjusting uses the global routed design to produce an adjusted global routed design, and wherein the detailed routing uses the adjusted global routed design and the priority associated with each net in the set of nets to produce a detailed routed design.

13. The computer usable program product of claim 11, wherein performing the pre-global routing optimization further comprises:

computer usable code for performing a pin density spreading operation on the design;

computer usable code for selecting a net from the set of nets whose timing characteristic has exceeded a threshold responsive to the pin density spreading operation; and

computer usable code for adjusting the timing characteristic of the net in-place such that a cell to which the net belongs does not change position.

14. The computer usable program product of claim 13, wherein adjusting the timing characteristic of the net the in-place is accomplished using one of (i) threshold voltage tuning, and (ii) gate resizing, further comprising:

computer usable code for performing a second global routing on the design including a change from the adjusting;

computer usable code for determining, following the second global routing, whether the design has deteriorated responsive to the change; and

computer usable code for undoing the change.

15. The computer usable program product of claim 11, wherein the setting the plurality of wirelength target constraints further comprises:

computer usable code for categorizing into a plurality of categories, each net in the set of nets according to a timing criticality and a wirelength associated with each net; and

computer usable code for associating with each category in the plurality of categories a wirelength target constraint.

16. The computer usable program product of claim 15, wherein setting the plurality of wirelength target constraints further comprises:

computer usable code for assigning, to a net whose wirelength in the design is less than a threshold wirelength, a wirelength target constraint that is more stringent as compared to a second wirelength target constraint assigned to a second net whose wirelength in the design is more than the threshold wirelength; and

computer usable code for assigning, to a third net whose slack is smaller than a slack threshold, a third wirelength target constraint that is more stringent as compared to a fourth wirelength target constraint assigned to a fourth net when the third net is more timing critical than the fourth net.

17. The computer usable program product of claim 11, wherein the adjusting the design using the wires placed in the design during global routing further comprises:

computer usable code for selecting, following the global routing, a net from the set of nets whose timing characteristic exceeds a threshold; and

computer usable code for performing, causing a change in the design, a timing optimization on the net using a subset of the wires placed in the design during the global routing.

18. The computer usable program product of claim 11, wherein the computer usable code is stored in a computer readable storage medium in a data processing system, and wherein the computer usable code is transferred over a network from a remote data processing system.

19. The computer usable program product of claim 11, wherein the computer usable code is stored in a computer readable storage medium in a server data processing system, and wherein the computer usable code is downloaded over a network to a remote data processing system for use in a computer readable storage medium associated with the remote data processing system.

20. A data processing system for timing driven routing in a design of an integrated circuit (IC), the data processing system comprising:

a storage device including a storage medium, wherein the storage device stores computer usable program code; and

a processor, wherein the processor executes the computer usable program code, and wherein the computer usable program code comprises;

computer usable code for performing, using a router application executing in a data processing system, a pre-global routing optimization of the design;

computer usable code for setting a plurality of wirelength target constraints on a plurality of subsets of a set of nets in the design;

computer usable code for performing global routing on the design;

computer usable code for adjusting the design using wires placed in the design during the global routing;

computer usable code for assigning a priority to each net in the set of nets; and

computer usable code for performing detailed routing on the design.