Routing method and apparatus

• US 6,931,616 B2
• Filed: 01/05/2002
• Issued: 08/16/2005
• Est. Priority Date: 08/23/2001
• Status: Expired due to Fees

• Current Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Original Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Inventors: Teig, Steven, Jacques, Etienne, Buset, Oscar
• Primary Examiner(s): Siek, Vuthe
• Application Number:
  US10/040,963
• Publication Number:
  US 20030066042A1
• Time in Patent Office: 1,319 Days
• Field of Search: 716/7, 716 8- 14
• US Class Current: 716/129
• CPC Class Codes: G06F 30/394 Routing G06F30/396 takes precedence
• CPC Class Codes: G11B 7/08582 Sled-type positioners

Abstract

A routing method that uses diagonal routes. This method routes several nets within a region of a circuit layout. Each net includes a set of pins in the region. The method initially partitions the region into several sub-regions. For each particular net in the region, the method then identifies a route that connects the sub-regions that contains a pin from the set of pins of the particular net. Some of the identified routes have edges that are at least partially diagonal.

Claims

1. A method of routing a net within a region of an integrated-circuit (“

IC”

) layout, the method comprising;

a) for the net, identifying a route that uses a first path within the region, wherein the first path shares a common region in the IC region with a set of adjacent paths, wherein said set has at least one path and each path in the set is adjacent to the first path;

b) determining whether embedding the route in the region will cause congestion about the first path and the set of paths to exceed a threshold combined capacity for routes to traverse along the first path and the set of paths; and

c) embedding the route for the net based at least partially on a determination that embedding the route in the region will not cause congestion about the first path and the set of paths to exceed the threshold combined capacity for routes to traverse along the first path and the set of paths.

2. The method of claim 1 further comprising discarding the route if embedding the route causes the congestion about the paths to exceed the threshold combined capacity for routes to traverse along the first path and the set of paths.

3. The method of claim 1, wherein congestion along the paths includes wireflow along the paths.

4. The method of claim 3, wherein congestion along the paths further includes blockages of the paths.

5. The method of claim 1, wherein the set of paths includes a second path, and the threshold combined capacity for routes to traverse along the first path and the set of paths equals the sum of the routing capacities of the first and second paths minus the routing capacity shared between the first and second paths.

6. The method of claim 5, wherein the first and second paths are diagonal paths that are defined on one routing layer.

7. The method of claim 6, wherein the first and second paths are in the same direction.

8. The method of claim 1, wherein the set of paths includes a second path and a third path, and the threshold combined capacity for routes to traverse along the first path and the set of paths equals the routing capacity of the first, second, and third paths minus the routing capacity shared among of the first, second, and third paths.

9. The method of claim 8, wherein the first, second, and third paths are diagonal paths that are defined on one routing layer.

10. The method of claim 9, wherein the first, second, and third paths are in the same direction.

11. The method of claim 1, wherein the set of paths includes a second path and a third path, wherein the first and second paths are diagonal paths, and the third path is a Manhattan path, wherein the third Manhattan path represents wireflow in the Manhattan and diagonal directions, wherein the threshold combined capacity for routes to traverse along the first path and the set of paths equals the routing capacity of the first, second, and third paths minus the routing capacity shared among the first, second, and third paths.

12. The method of claim 1, wherein the set of paths includes second, third, fourth, and fifth adjacent paths, wherein the first through fourth paths are diagonal paths, and the fifth path is a Manhattan path, wherein the fifth path represents wireflow in the Manhattan and diagonal directions, wherein the threshold combined capacity for routes to traverse along the first path and the set of paths equals the routing capacity of the first through fifth paths minus the routing capacity shared among the first through fifth paths.

13. The method of claim 1, wherein said determination of whether to embed the route is formulated as a constraint of a linear programming problem.

14. A method of routing nets within a region of an integrated-circuit (“

IC”

) layout, the method comprising;

a) partitioning the IC region into a plurality of sub-regions, wherein a plurality of paths exist between the sub-regions, each path representing a plurality of routing tracks, and at least a first path shares routing tracks with a set of paths;

b) for the net, identifying a route that uses the first path;

c) determining whether embedding the route will cause congestion along the first path and the set of paths to exceed the number of tracks available along the first path and the set of paths; and

d) embedding the route for the net based at least partially on a determination that embedding the route will not cause the congestion along the first path and the set of paths to exceed the number of tracks available along the first path and the set of paths.

15. The method of claim 14, wherein the set of paths includes a second path that represents routing tracks on a routing layer that also includes at least some of the routing tracks of the first path.

16. The method of claim 15, wherein the first and second paths are diagonal paths that are in the same direction.

17. The method of claim 15, wherein the first path is a diagonal path and the second path is a Manhattan path.

18. The method of claim 14, wherein the set of paths includes a second path and a third path, wherein the first, second, and third paths are diagonal paths that are in the same direction and that are defined on one routing layer.

19. The method of claim 14, wherein the set of paths includes a second path and a third path, wherein the first and second paths are diagonal paths, and the third path is a Manhattan path, wherein the third Manhattan path represents a plurality of tracks in the Manhattan and diagonal directions.

20. The method of claim 14, wherein the set of paths includes second, third, fourth, and fifth paths, wherein the first through fourth paths are diagonal paths, and the fifth path is a Manhattan path, wherein the fifth path represents a plurality of tracks in the Manhattan and diagonal directions.

21. A method of routing nets within a region of an integrated-circuit (“

IC”

) layout, the method comprising;

a) partitioning the IC region into a plurality of sub-regions, wherein a plurality of paths exist between the sub-regions, each path representing a plurality of routing tracks, and at least a first path shares routing tracks with a set of paths;

b) for the net, identifying a route that uses the first path; and

c) determining whether to embed the route at least partially based on the number of tracks available along the first path and the set of paths;

wherein the number of available tracks equals the number of tracks along the first path and along the set of paths minus the number of tracks shared between the first path and the set of paths minus the number of tracks used and blocked along the first path and the set of paths.

22. The method of claim 21, wherein the number of tracks available along the first path and the set of paths is not the only criteria for determining whether to embed the route.

23. A computer readable medium comprising a computer program having executable code, the computer program for routing a net within a region of an integrated-circuit (“

IC”

) layout, the computer program comprising;

a) a first set of instructions for identifying a route for the net, said route using a first path within the region, wherein the first path shares a common region in the IC region with a set of adjacent paths, wherein said set has at least one path and each path in the set is adjacent to the first path;

b) a second set of instructions for determining whether embedding the route in the region will cause congestion about the first path and the set of paths to exceed a threshold combined capacity for routes to traverse along the first path and the set of paths; and

c) a third set of instructions for embedding the route for the net based at least partially on a determination that embedding the route in the region will not cause congestion about the first path and the set of paths to exceed the threshold combined capacity for routes to traverse along the first path and the set of paths.

24. The computer readable medium of claim 23 wherein the third set of instructions comprises a fourth set of instructions for discarding the route when embedding the route causes the congestion about the paths to exceed the threshold combined capacity for routes to traverse along the first path and the set of paths.

25. The computer readable medium of claim 23, wherein congestion along the paths includes wireflow along the paths.

26. The computer readable medium of claim 25, wherein congestion along the paths further includes blockages of the paths.

27. The computer readabic medium of claim 23, wherein the set of paths includes a second path, and the threshold combined capacity for routes to traverse along the first path and the set of paths equals the sum of the routing capacities of the first and second paths minus the routing capacity shared between the first and second paths.

28. The computer readable medium of claim 23, wherein the set of paths includes a second path and a third path, and the threshold combined capacity for routes to traverse along the first path and the set of paths equals the routing capacity of the first, second, and third paths minus the routing capacity shared among the first, second, and third paths.

29. The computer readable medium of claim 23, wherein the set of paths includes a second path and a third path, wherein the first and second paths are diagonal paths, and the third path is a Manhattan path, wherein the third Manhattan path represents wireflow in the Manhattan and diagonal directions, wherein the threshold combined capacity for routes to traverse along the first path and the set of paths equals the routing capacity of the first, second, and third paths minus the routing capacity shared among the first, second, and third paths.

30. The computer readable medium of claim 23, wherein the set of paths includes second, third, fourth, and fifth adjacent paths, wherein the first through fourth paths are diagonal paths, and the fifth path is a Manhattan path, wherein the fifth path represents wireflow in the Manhattan and diagonal directions, wherein the threshold combined capacity for routes to traverse along the first path and the set of paths equals the routing capacity of the first through fifth paths minus the routing capacity shared among the first through fifth paths.