Metal layer assignment

• US 6,182,272 B1
• Filed: 07/16/1998
• Issued: 01/30/2001
• Est. Priority Date: 07/16/1998
• Status: Expired due to Term

• Current Assignee: Bell Semiconductor, LLC (Hilco Inc. (d/b/a Hilco Global))
• Original Assignee: LSI Logic Corporation (Broadcom, Inc.)
• Inventors: Andreev, Alexander, Pavisic, Ivan, Raspopovic, Pedja
• Primary Examiner(s): Lintz, Paul R.
• Assistant Examiner(s): GARBOWSKI, LEIGH M
• Application Number:
  US09/118,661
• Time in Patent Office: 929 Days
• Field of Search: 716/1, 716/2, 716/3, 716/8, 716/9, 716/10, 716/11, 716/12, 716/13, 716/14, 716/15, 716/16, 716/18
• US Class Current: 716/129
• CPC Class Codes: G06F 30/394 Routing G06F30/396 takes precedence

Abstract

Routing layers are assigned to connection segments in integrated circuit design. A routing description that includes connection segments and a vertex where at least two of the connection segments connect to each other is obtained. A penalty is determined for the vertex based on a potential layer assignment combination for the connection segments that connect at the vertex, and routing layers are assigned to the connection segments based on the determined penalty.

Claims

1. A method for assigning routing layers to connection segments in integrated circuit design, said method comprising:

an obtaining step of obtaining a routing description of a net that includes plural connection segments and plural vertices, each of the plural vertices being a vertex;

a generating step of generating a tree-shaped routing graph from the routing description by selecting one of the plural vertices to be a root and forming edges corresponding to the connection segments such that each vertex other than the root has only one edge leading to it from a next higher hierarchical level;

a determining step of determining penalty values for plural different potential routing layer assignment combinations by traversing the tree-shaped routing graph in a bottom-up fashion, wherein each potential routing layer assignment combination represents one possible combination of assignments of at least a subset of the edges to specific routing layers; and

an assigning step of assigning routing layers to the plural connection segments based on the penalty values determined in said determining step.

2. A method according to claim 1, wherein each of the plural connection segments is one of a vertical segment and a horizontal segment.

3. A method according to claim 1, wherein the routing description provides only a coarse routing description.

4. A method according to claim 1, wherein the penalty values are determined at the vertices of the routing graph, and wherein the penalty value for each vertex is defined with respect to a particular potential routing layer assignment combination as:

(i) a maximum routing layer number for all edges connecting at said each vertex minus a minimum routing layer number for all edges connecting at said each vertex;

plus (ii) the penalty values, still assuming said particular potential routing layer assignment combination, for all vertices that are immediate descendants of said each vertex.

5. A method according to claim 4, wherein said determining step determines a separate penalty value for each of a plurality of said plural different potential routing layer assignment combinations for a single vertex.

6. A method according to claim 5, wherein the plural different potential routing layer assignment combinations are identified by determining, for a particular routing layer, whether a relative occupancy of connection segments on all routing layers of a same direction as the particular routing layer and below the particular routing layer is less than the relative occupancy of connection segments on all routing layers of the same direction as the particular routing layer.

7. A method according to claim 1, wherein plural of the edges have descendants in the tree-shaped routing graph, and wherein in said determining step no edge is processed prior to any of its descendants.

8. A method according to claim 1, wherein as the tree-shaped routing graph is traversed at least some of the potential routing layer assignment combinations are eliminated.

9. A method according to claim 8, wherein said determining step comprises:

identifying situations when at least two of the plural different potential routing layer assignment combinations result in a same routing layer assignment for the one edge leading to a particular vertex from the next higher hierarchical level; and

determining whether said at least two of the plural different potential routing layer assignment combinations result in different penalty values for said particular vertex and, if so, eliminating an inferior one of said at least two of the plural different potential routing layer assignment combinations.

10. A method according to claim 1, wherein the penalty values are determined at the vertices of the routing graph, and wherein the penalty value for each vertex is defined with respect to a particular potential routing layer assignment combination as:

(i) a first component that is based on routing layer assignments for all edges connecting at said each vertex;

plus (ii) the penalty values, still assuming said particular potential routing layer assignment combination, for all vertices that are immediate descendants of said each vertex.

11. A method according to claim 10, wherein, for each vertex, a penalty value is determined for each potential routing layer assignment combination remaining for the vertices below said each vertex in the tree-shaped routing graph.

12. A method according to claim 11, wherein inferior potential routing layer assignment combinations, as determined by the penalty values, are eliminated when processing each vertex.

13. A method according to claim 1, further comprising a step of enumerating the edges so that each edge has a higher number than any of its descendants, and wherein in said determining step the edges are processed in order of the enumeration.

14. A method according to claim 13, wherein the edges are processed using dynamic programming to identify a layer assignment combination for all of the edges having a minimum combined penalty.

15. A method according to claim 1, further comprising an identifying step of identifying allowable routing layers for each edge.

16. A method according to claim 15, wherein the allowable routing layers for a particular edge include only those routing layers for which both:

(1) there is space for the particular edge; and

(2) a relative occupancy of edges corresponding to the particular connection segment on lower routing layers having a same direction as the particular edge is not less than the relative occupancy of corresponding edges on all routing layers having the same direction as the particular edge.

17. A method according to claim 1, wherein said determining step is performed by utilizing dynamic programming.

18. A method according to claim 1, wherein said obtaining step, said determining step said generating step and said assigning step are performed for each net to be implemented in the integrated circuit design.

19. An apparatus for assigning routing layers to connection segments in integrated circuit design, said apparatus comprising:

obtaining means for obtaining a routing description of a net that includes plural connection segments and plural vertices, each of the plural vertices being a vertex;

generating means for generating a tree-shaped routing graph from the routing description by selecting one of the plural vertices to be a root and forming edges corresponding to the connection segments such that each vertex other than the root has only one edge leading to it from a next higher hierarchical level;

determining means for determining penalty values for plural different potential routing layer assignment combinations by traversing the tree-shaped routing graph in a bottom-up fashion, wherein each potential routing layer assignment combination represents one possible combination of assignments of at least a subset of the edges to specific routing layers; and

assigning means for assigning routing layers to the plural connection segments based on the penalty values determined by said determining means.

20. An apparatus according to claim 19, said determining means comprises means for performing dynamic programming.

21. An apparatus according to claim 19, wherein the penalty values are determined at the vertices of the routing graph, and wherein the penalty value for each vertex is defined with respect to a particular potential routing layer assignment combination as:

(i) a first component that is based on routing layer assignments for all edges connecting at said each vertex;

plus (ii) the penalty values, still assuming said particular potential routing layer assignment combination, for all vertices that are immediate descendants of said each vertex.

22. An apparatus according to claim 21, wherein, for each vertex, a penalty value is determined for each potential routing layer assignment combination remaining for the vertices below said each vertex in the tree-shaped routing graph.

23. An apparatus according to claim 22, wherein inferior potential routing layer assignment combinations, as determined by the penalty values, are eliminated when processing each vertex.

24. An apparatus according to claim 19, wherein as the tree-shaped routing graph is traversed at least some of the potential routing layer assignment combinations are eliminated.

25. An apparatus according to claim 24, wherein said determining includes means for:

identifying situations when at least two of the plural different potential routing layer assignment combinations result in a same routing layer assignment for the one edge leading to a particular vertex from the next higher hierarchical level; and

determining whether said at least two of the plural different potential routing layer assignment combinations result in different penalty values for said particular vertex and, if so, eliminating an inferior one of said at least two of the plural different potential routing layer assignment combinations.

26. A computer-readable medium storing computer-executable process steps for assigning routing layers to connection segments in integrated circuit design, said process steps comprising:

an obtaining step to obtain a routing description of a net that includes plural connection segments and plural vertices, each of the plural vertices being a vertex;

a generating step to generate a tree-shaped routing graph from the routing description by selecting one of the plural vertices to be a root and forming edges corresponding to the connection segments such that each vertex other than the root has only one edge leading to it from a next higher hierarchical level;

a determining step to determine penalty values for plural different potential routing layer assignment combinations by traversing the tree-shaped routing graph in a bottom-up fashion, wherein each potential routing layer assignment combination represents one possible combination of assignments of at least a subset of the edges to specific routing layers; and

an assigning step to assign routing layers to the plural connection segments based on the penalty values determined in said determining step.

27. A computer-readable medium according to claim 26, wherein said determining step is performed by utilizing dynamic programming.

28. A computer-readable medium according to claim 26, wherein the penalty values are determined at the vertices of the routing graph, and wherein the penalty value for each vertex is defined with respect to a particular potential routing layer assignment combination as:

(i) a first component that is based on routing layer assignments for all edges connecting at said each vertex;

plus (ii) the penalty values, still assuming said particular potential routing layer assignment combination, for all vertices that are immediate descendants of said each vertex.

29. A computer-readable medium according to claim 28, wherein, for each vertex, a penalty value is determined for each potential routing layer assignment combination remaining for the vertices below said each vertex in the tree-shaped routing graph.

30. A computer-readable medium according to claim 29, wherein inferior potential routing layer assignment combinations, as determined by the penalty values, are eliminated when processing each vertex.

31. A computer-readable medium according to claim 26, wherein as the tree-shaped routing graph is traversed at least some of the potential routing layer assignment combinations are eliminated.

32. A computer-readable medium according to claim 31, wherein said determining step comprises steps to:

identify situations when at least two of the plural different potential routing layer assignment combinations result in a same routing layer assignment for the one edge leading to a particular vertex from the next higher hierarchical level; and

determine whether said at least two of the plural different potential routing layer assignment combinations result in different penalty values for said particular vertex and, if so, eliminate an inferior one of said at least two of the plural different potential routing layer assignment combinations.