Method and apparatus for performing routability checking

• US 7,013,451 B1
• Filed: 10/31/2002
• Issued: 03/14/2006
• Est. Priority Date: 01/22/2002
• 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
• Primary Examiner(s): Smith, Matthew
• Assistant Examiner(s): Kik, Phallaka
• Application Number:
  US10/286,630
• Time in Patent Office: 1,230 Days
• Field of Search: 716/13, 716/14, 716/7, 716/19
• US Class Current: 716/129
• CPC Class Codes: G06F 30/394 Routing G06F30/396 takes precedence

Abstract

Some embodiments of the invention provide a method of determining whether a set of routes can be geometrically embedded in a region according to a particular wiring model. The method identifies a congestion graph that has a set of edges, where at least two edges are neither orthogonal nor parallel. For each edge, the method identifies the set of routes that intersect the edge. It then determines whether any edge is overcongested.

Claims

1. A method of determining whether a set of routes can be geometrically embedded in a region according to a particular wiring model, the method comprising:

a) identifying a congestion graph having a set of edges, wherein at least two edges are neither orthogonal nor parallel;

b) for each edge;

identifying a set of routes that intersect the edge; and

determining whether said edge is overcongested based on said identified set of routes.

2. The method of claim 1 further comprising:

if any edge is overcongested, modifying at least one of the routes.

3. The method of claim 2, wherein each particular route is a topological route for a particular net in the region, and wherein modifying the routes comprises defining at least one new topological route for a net.

4. The method of claim 3, wherein the set of edges is a first set of edges, wherein the topological routes are defined with respect to a second set of edges in a topological graph, wherein identifying the congestion graph comprises adding additional edges to the topological graph.

5. The method of claim 4, wherein the congestion graph is an approximation of a visibility graph.

6. The method of claim 4, wherein the congestion graph is a visibility graph.

7. The method of claim 4, wherein determining whether any edge is overcongested comprises:

for each edge,

identifying a capacity for the edge based on the wiring model;

identifying a route flow across the edge;

deriving a congestion value based on the identified capacity and flow.

8. The method of claim 7, wherein the route flow of an edge is derived from width and spacing constraints of the routes that cross the edge.

9. The method of claim 7, wherein identifying the route flow comprises:

identifying the route flow of a particular edge that is part of the topological graph when the topological routes are defined, and

identifying the route flow of a particular edge that is part of the congestion graph but not the topological graph is computed based on the route flow of the edges that surround the particular edge in the congestion graph.

10. The method of claim 9, wherein identifying the route flow of a particular edge based on the route flow of the edges that surround the particular edge in the congestion graph comprising using a recursive operation that first computes the route flow of another particular edge that is in the congestion graph but not the topological graph.

11. A computer readable medium that stores a computer program having executable code, the computer program for determining whether a set of routes can be geometrically embedded in a region according to a particular wiring model, the computer program comprising sets of instructions for:

a) identifying a congestion graph having a set of edges, wherein at least two edges are neither orthogonal nor parallel;

b) for each edge;

identifying a set of routes that intersect the edge; and

determining whether said edge is overcongested based on said identified set of routes.

12. The computer readable medium of claim 11, wherein the computer program further comprises a set of instructions for modifying at least one of the routes if any edge is overcongested.

13. The computer readable medium of claim 12, wherein each particular route is a topological route for a particular net in the region, and wherein the set of instructions for modifying the routes comprises a set of instructions for defining at least one new topological route for a net.

14. The computer readable medium of claim 13, wherein the set of edges is a first set of edges, wherein the topological routes are defined with respect to a second set of edges in a topological graph, wherein the set of instructions for identifying the congestion graph comprises a set of instructions for adding additional edges to the topological graph.

15. The computer readable medium of claim 14, wherein the congestion graph is an approximation of a visibility graph.

16. The computer readable medium of claim 14, wherein the congestion graph is a visibility graph.

17. The computer readable medium of claim 14, wherein the set of instructions for determining whether any edge is overcongested comprises a set of instructions for:

identifying, for each edge, a capacity for the edge based on the wiring model;

identifying, for each edge, a route flow across the edge;

deriving, for each edge, a congestion value base on the identified capacity and flow.

18. The computer readable medium of claim 17, wherein the route flow of an edge is derived from width and spacing constraints of the routes that cross the edge.

19. The computer readable medium of claim 17, wherein the set of instructions for identifying the route flow comprises sets of instructions for:

identifying the route flow of a particular edge that is part of the topological graph when the topological routes are defined, and

identifying the route flow of a particular edge that is part of the congestion graph but not the topological graph is computed based on the route flow of the edges that surround the particular edge in the congestion graph.