Method for eliminating routing congestion in an IC layout

• US 7,225,116 B2
• Filed: 08/20/2002
• Issued: 05/29/2007
• Est. Priority Date: 08/20/2002
• Status: Expired due to Fees

• Current Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Original Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Inventors: Harn, Ywh-Pyng
• Primary Examiner(s): Shah; Kamini
• Assistant Examiner(s): PATEL, SHAMBHAVI K
• Application Number:
  US10/225,215
• Publication Number:
  US 20040040007A1
• Time in Patent Office: 1,743 Days
• Field of Search: 703/14
• US Class Current: 703/14
• CPC Class Codes: G06F 2119/12 Timing analysis or timing optimisation
• CPC Class Codes: G06F 30/392 Floor-planning or layout, e.g. partitioning or placement
• CPC Class Codes: G06F 30/394 Routing G06F30/396 takes precedence
• CPC Class Codes: G06F 30/3953 detailed
• CPC Class Codes: G06F 30/396 Clock trees

Abstract

The invention relates to a method for eliminating routing congestion in an integrated circuit (IC) layout defined by a placement plan indicating a position within the layout of each cell forming the IC and routing plan describing routes followed by nets interconnecting the cells. Routing congestion is eliminated by estimating routing congestion in various areas of the layout and relocating each cell to least routing congested areas of the layout for which cell relocation results in a reduction in the total lengths of the nets connected to the cell that exceeds a predetermined minimum reduction.

Claims

1. A method for eliminating routing congestion in an integrated circuit (IC) layout for an IC to be fabricated, wherein a placement plan specifies a position within the layout for each of a plurality of cells that are be included in the IC, and wherein the cells are to be interconnected by nets routed in accordance with a routing plan, the method comprising the steps of:

a. selecting one of the cells and a target position therefor;

b. selecting a target area at a portion of the layout such that if the placement plan were to be revised to specify that the selected cell is to be positioned anywhere within the target area, the revision to the placement plan would reduce an amount of space within the layout that the routing plan must allocate to the nets to be connected to that cell, the target area being peripherally defined about the target position by a boundary selectively set for the selected cell;

c. dividing the target area into an array of blocks delineated therein, wherein each block spans a separate portion of the target area, and wherein each block includes cell space for accommodating cells and routing space for accommodating nets;

d. selecting one of the blocks having an estimated amount of unoccupied cell space sufficient to accommodate the selected cell; and

e. revising the placement plan so that it specifies that the selected cell is to be positioned within the selected block.

2. The method in accordance with claim 1 wherein step a comprises the substeps of:

a1. identifying a separate target point within the layout for each cell that is distant from the position of the selected cell specified by the placement plan; and

a2. choosing as the selected cell, the cell having a highest estimated amount of reduction in routing space that would be occupied by the nets connected to the cell if the cell were to be relocated to its target position.

3. The method in accordance with claim 2 wherein the target area for the selected cell surrounds the cell'"'"'s target point.

4. The method in accordance with claim 2 wherein the target point for each cell is selected as a centroid of centroids of all other cells that are to be connected through nets to the cell.

5. The method in accordance with claim 2 wherein step d comprises the substeps of:

d1. establishing a routing plan specifying routes of nets that are to interconnect the cells positioned in accordance with the placement plan; and

d2. selecting the selected block from among the all blocks of the array, based on estimates of unoccupied cell space and unoccupied routing space within the block, the estimates being derived by analyzing the placement plan and the trial routing plan.

6. The method in accordance with claim 5 wherein the one block is chosen from among all blocks of the array as being the block having an estimated amount of unoccupied cell space sufficient to accommodate the selected cell as the selected block and also having a highest estimated amount of unoccupied routing space.

7. The method in accordance with claim 5 wherein the target point for each particular cell is selected as a centroid of centroids of a set of rectangular areas of the layout, wherein each rectangular area corresponds to a separate net connected to the particular cell and is of minimum dimensions needed to bound all terminations of the corresponding net on all cells other than the particular cell.

8. A method for generating a layout for an IC formed by cells interconnected by nets, the layout comprising a detailed placement plan specifying the position each cell is to occupy in the layout and a detailed routing plan specifying a route each net is to follow when interconnecting the cells, the method comprising the steps of:

a. generating a global placement plan specifying an approximate position of each cell within the layout;

b. generating a first trial routing plan specifying an approximate route each net is to follow within the layout;

c. selecting each one of the cells referenced in the global placement plan and a target position therefor;

d. selecting a first target area of the layout such that if the global placement plan were to be revised to specify that the selected cell is to be positioned anywhere with the first target area, such revision to the global placement plan would reduce an amount of space within the layout that must be allocated to the nets to be connected to the selected cell, the target area being peripherally defined about the target position by a boundary selectively set for the selected cell;

e. organizing the target area into a first array of blocks, wherein each block of the first array spans a separate portion of the first target area, and wherein each block of the first array includes cell space for holding cells and routing for holding nets;

f. selecting one of the blocks having an estimated amount of unoccupied cell space sufficient to hold the selected cell; and

g. revising the global placement plan to produce a revised global placement plan specifying that the selected cell is to be positioned within the block selected at step f.

9. The method in accordance with claim 8 further comprising the steps of:

h. processing the global placement plan revised at step g to produce a detailed placement plan specifying an exact position within the layout of each cell.

10. The method in accordance with claim 9 further comprising the steps of:

i. generating a second trial routing plan specifying an approximate route each net is to follow within the layout to interconnect cells positioned as specified in the detailed placement plan;

j. selecting one of the cells specified by the detailed placement plan;

k. selecting a second target area of the layout such that if the detailed placement plan were to be revised to specify that the cell selected at step j is to be positioned anywhere within the second target area, such revision to the detailed placement plan would reduce an amount of routing space within the layout that would have to be allocated to the nets to be connected to the cell selected at step j;

l. organizing the second target area into a second array of blocks, wherein each block of the second array spans a separate portion of the second target area, and wherein each block of the second array includes cell space for accommodating cells and routing space for accommodating nets;

m. selecting one of the blocks of the second array having an estimated amount of unoccupied cell space sufficient to hold the cell selected at step j; and

n. revising the detailed placement plan so that it specifies that the cell selected at step j is to be positioned within the block selected at step m.

11. The method in accordance with claim 10 further comprising the steps of:

o. generating a detailed routing plan specifying an exact route of each net within the layout interconnecting cells positioned as specified by the detailed placement plan.

12. The method in accordance with claim 8 wherein step c comprises the substeps of:

c1. identifying a separate target point within the layout for each cell that is distant from the position of the selected cell specified by the global placement plan; and

c2. choosing as the cell selected at step c, the cell for having a highest estimated amount of reduction in routing space that would be occupied by the nets connected to the cell if the cell were to be relocated to its target position.

13. The method in accordance with claim 12 wherein the first target area for the cell selected at step c surrounds the cell'"'"'s target point.

14. The method in accordance with claim 12 wherein the target point for each cell is selected as a centroid of centroids of all other cells that are to be connected through nets to the cell.

15. The method in accordance with claim 9 wherein selection of the block at step f is selected based on estimates of unoccupied cell space and unoccupied routing space within the block derived by analyzing the placement plan and the first trial routing plan.

16. The method in accordance with claim 15 wherein the block selected at step f is chosen from among all blocks of the array as being the block having an estimated amount of unoccupied cell space sufficient to accommodate the selected cell as the selected block and also having a highest estimated amount of unoccupied routing space.

17. The method in accordance with claim 15 wherein the target point for each particular cell is selected as a centroid of centroids of a set of rectangular areas of the layout, wherein each rectangular area corresponds to a separate net connected to the particular cell and is of minimum dimensions needed to bound all terminations of the corresponding net on all cells other than the particular cell.

18. Computer readable media containing software which when read and executed by a computer causes the computer to carry out a method for eliminating routing congestion in an integrated circuit (IC) layout for an IC to be fabricated, wherein a placement plan specifies a position within the layout for each of a plurality of cells that are to be included in the IC, and wherein the cells are to be interconnected by nets within the IC routed within the layout in accordance with a routing plan, wherein the method comprising the steps of:

a. selecting one of the cells and a target position therefor;

b. selecting a target area of the layout such that if the placement plan were to be revised to specify that the selected cell is to be positioned anywhere within the target area, the revision to the placement plan would reduce an amount of space within the layout that the routing plan must allocate to the nets to be connected to that cell, the target area being peripherally defined about the target position by a boundary selectively set for the selected cell;

c. organizing the target area into an array of blocks, wherein block spans a separate portion of the target area, and wherein each block includes cell space for accommodating cells and routing space for accommodating nets;

d. selecting one of the blocks having an estimated amount of unoccupied cell space sufficient to accommodate the selected cell; and

e. revising the placement plan so that it specifies that the selected cell is to be positioned within the selected block.

19. The computer readable media in accordance with claim 18 wherein step a comprises the substeps of:

a1. identifying a separate target point within the layout for each cell that is distant from the position of the selected cell specified by the placement plan; and

a2. choosing as the selected cell, the cell having a highest estimated amount of reduction in routing space that would be occupied by the nets connected to the cell if the cell were to be relocated to its target position.

20. The computer readable media in accordance with claim 19 wherein the target area for the selected cell surrounds the cell'"'"'s target point.

21. The computer readable media in accordance with claim 19 wherein the target point for each cell is selected as a centroid of centroids of all other cells that are to be connected through nets to the cell.

22. The computer readable media in accordance with claim 19 wherein step d comprises the substeps of:

d1. establishing a routing plan specifying routes of nets that are to interconnect the cells positioned in accordance with the placement plan; and

d2. selecting the selected block from among the all blocks of the array, based on estimates of unoccupied cell space and unoccupied routing space within the block, the estimates being derived by analyzing the placement plan and the trial routing plan.

23. The computer readable media in accordance with claim 22 wherein the one block is chosen from among all blocks of the array as being the block having an estimated amount of unoccupied cell space sufficient to accommodate the selected cell as the selected block and also having a highest estimated amount of unoccupied routing space.

24. The method in accordance with claim 22 wherein the target point for each particular cell is selected as a centroid of centroids of a set of rectangular areas of the layout, wherein each rectangular area corresponds to a separate net connected to the particular cell and is of minimum dimensions needed to bound all terminations of the corresponding net on all cells other than the particular cell.

25. Computer readable media storing software which when read and executed by a computer causes the computer to cany out a method for generating a layout for an IC formed by cells interconnected by nets, the layout comprising a detailed placement plan specifying the position each cell is to occupy in the layout and a detailed routing plan specifying a route each net is to follow when interconnecting the cells, the method comprising the steps of:

a. generating a global placement plan specifying an approximate position of each cell within the layout;

b. generating a first trial routing plan specifying an approximate route each net is to follow within the layout;

c. selecting one of the cells referenced in the global placement plan and a target position therefor;

d. selecting a first target area of the layout such that if the global placement plan were to be revised to specify that the selected cell is to be positioned anywhere within the first target area, such revision to the global placement plan would reduce an amount of space within the layout that must be allocated to the nets to be connected to the selected cell, the first target area being peripherally defined about the target position by a boundary selectively set for the selected cell;

e. organizing the target area into a first array of blocks, wherein each block of the first array spans a separate portion of the first target area and wherein each block of the first array includes cell space for holding cells and routing space for holding nets;

f. selecting one of the blocks having an estimated amount of unoccupied cell space sufficient to hold the selected cell; and

g. revising the global placement plan to produce a revised global placement plan specifying that the selected cell is to be positioned within the block selected at step f.

26. The computer readable media in accordance with claim 25 wherein the method further comprises the steps of:

h. processing the global placement plan revised at step g to produce a detailed placement plan specifying an exact position within the layout of each cell.

27. The computer readable media in accordance with claim 26 wherein the method further comprises the steps of:

i. generating a second trial routing plan specifying an approximate route each net is to follow within the layout to interconnect cells positioned as specified in the detailed placement plan;

j. selecting one of the cells specified by the detailed placement plan;

k. selecting a second target area of the layout such that if the detailed placement plan were to be revised to specify that the cell selected at step j is to be positioned anywhere within the second target area, such revision to the detailed placement plan would reduce an amount of routing space within the layout that would have to be allocated to the nets to be connected to the cell selected at step j;

l. organizing the second target area into a second array of blocks, wherein each block of the second array spans a separate portion of the second target area, and wherein each block of the second array includes cell space for accommodating cells and routing space for accommodating nets;

m. selecting one of the blocks of the second array having an estimated amount of unoccupied cell space sufficient to hold the cell selected at step j; and

n. revising the detailed placement plan so that it specifies that the cell selected at step j is to be positioned within the block selected at step m.

28. The computer readable media in accordance with claim 27 wherein the method further comprises the steps of:

o. generating a detailed routing plan specifying an exact route of each net within the layout interconnecting cells positioned as specified by the detailed placement plan.

29. The computer readable media in accordance with claim 25 wherein step c comprises the substeps of:

c1. identifying a separate target point within the layout for each cell that is distant from the position of the selected cell specified by the global placement plan; and

c2. choosing as the cell selected at step c, the cell for having a highest estimated amount of reduction in routing space that would be occupied by the nets connected to the cell if the cell were to be relocated to its target position.

30. The computer readable media in accordance with claim 29 wherein the first target area for the cell selected at step c surrounds the cell'"'"'s target point.

31. The computer readable media in accordance with claim 29 wherein the target point for each cell is selected as a centroid of centroids of all other cells that are to be connected through nets to the cell.

32. The computer readable media in accordance with claim 25 wherein selection of the block at step f is selected based on estimates of unoccupied cell space and unoccupied routing space within the block derived by analyzing the placement plan and the first trial routing plan.

33. The computer readable media in accordance with claim 32 wherein the block selected at step f is chosen from among all blocks of the array as being the block having an estimated amount of unoccupied cell space sufficient to accommodate the selected cell as the selected block and also having a highest estimated amount of unoccupied routing space.

34. The method in accordance with claim 32 wherein the target point for each particular cell is selected as a centroid of centroids of a set of rectangular areas of the layout, wherein each rectangular area corresponds to a separate net connected to the particular cell and is of minimum dimensions needed to bound all terminations of the corresponding net on all cells other than the particular cell.

35. A method for eliminating routing congestion in an integrated circuit (IC) layout defined by a placement plan specifying a position within the layout of each cell forming the IC and routing plan describing routes followed by nets interconnecting the cells, the method comprising the steps of:

a. estimating routing congestion in selected areas of the layout based on the routing plan, and selecting respective target positions for cells to be repositioned; and

b. revising the placement plan to reposition cells to respective vacant areas within least routing congested ones of selected target areas of the layout for which cell relocation results in a reduction in the total lengths of the nets connected to the cell that exceeds a predetermined minimum reduction, whereby the revision would reduce an amount of space within the layout that the routing plan must allocate to the nets to be connected to the repositioned cells, the target areas each being peripherally defined about a corresponding one of the target positions by a boundary selectively set for the selected cell therefor.

36. Computer readable media containing software which when read and executed by a computer causes the computer to carry out a method for eliminating routing congestion in an integrated circuit (IC) layout defined by a placement plan specifying a position within the layout of each cell forming the IC and routing plan describing routes followed by nets interconnecting the cells, wherein method comprising the steps of:

a. estimating routing congestion in selected areas of the layout based on the routing plan, and selecting respective target positions for cells to be repositioned; and

b. revising the placement plan to reposition cells within least routing congested ones of selected target areas of the layout for which cell relocation results in a reduction in the total lengths of the nets connected to the cell that exceeds a predetermined minimum reduction. whereby the revision would reduce an amount of space within the layout that the routing plan must allocate to the nets to be connected to the repositioned cells, the target areas each being peripherally defined about a corresponding one of the target positions by a boundary selectively set for the selected cell therefore.