Physical design automation system and process for designing integrated circuit chips using highly parallel sieve optimization with multiple "jiggles"

• US 5,909,376 A
• Filed: 11/20/1995
• Issued: 06/01/1999
• Est. Priority Date: 11/20/1995
• 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: Roseboom, Edward M., Scepanovic, Ranko, Andreev, Alexander E., Koford, James S., Aleshin, Stanislav V., Podkolzin, Alexander S., Kudryavtsev, Valeriy B.
• Primary Examiner(s): Teska, Kevin J.
• Assistant Examiner(s): Kik, Phallaka
• Application Number:
  US08/560,848
• Time in Patent Office: 1,289 Days
• Field of Search: 364/488-91, 364/578, 364/468, 357/45, 345/921
• US Class Current: 716/123
• CPC Class Codes: G06F 30/392 Floor-planning or layout, e.g. partitioning or placement

Abstract

A process for implementation on a programmed digital computer includes providing a placement of clusters of cells which are assigned to regions on an integrated circuit chip, and combining the regions to form region groups. The region groups collectively constitute a "jiggle" which resembles a sieve. The clusters in each region group are re-assigned to the regions in the region group. The regions are recombined to form different region groups (a different jiggle), and the clusters in each different region group are re-assigned to the regions in the different region group. These steps are repeated using at least two, preferably four different jiggles, until an end criterion is reached. Then, the regions and clusters are hierarchically subdivided, and the process is repeated for each hierarchical level until the clusters have been reduced to individual cells. The regions of the region groups at each level are contiguous, and the region groups overlap, such that a cluster can be moved from any region to any other region on the chip by sufficient repetition of the assignment step using alternating jiggles.

Claims

1. A process for designing an integrated circuit chip, comprising the steps of:

(a) providing a placement of clusters of cells, each cluster being assigned to one of plural predefined and non-overlapping regions on the chip;

(b) combining the pre-defined and non-overlapping regions to form region groups;

(c) performing a first cluster placement improvement operation within respective region groups that re-assigns the clusters in each region group to the other pre-defined and non-overlapping regions in said each region group when a cell placement cost function is reduced;

(d) re-combining the pre-defined and non-overlapping regions to form different region groups; and

(e) performing a second cluster placement improvement operation within respective different region groups that re-assigns the clusters in each different region group to the other pre-defined and non-overlapping regions in said each different region group when a cell placement cost function is reduced.

2. A process as in claim 1, in which the regions in each region group are contiguous;

and

the regions in each different region group are contiguous.

3. A process as in claim 2, in which:

the region groups partially overlap; and

the different region groups partially overlap.

4. A process as in claim 3, further comprising the step of:

(f) repeating steps (d) and (e) until an end criterion has been reached.

5. A process as in claim 4, in which the region groups are combined, and the different region groups are re-combined, such that each cluster can be re-assigned to any region in step (f).

6. A process as in claim 1, further comprising the step of:

(f) repeating steps (d) and (e) until an end criterion has been reached.

7. A process as in claim 6, further comprising the step of:

(g) specifying interconnections for the cells, in which;

the end criterion is such that a total length of the interconnections has been reduced below a predetermined value.

8. A process as in claim 1, further comprising the steps of:

(f) re-clustering the cells to form smaller clusters;

(g) subdividing the regions to form subregions;

(h) combining the subregions to form subregion groups;

(i) re-assigning the smaller clusters in each subregion group to the subregions in said each subregion group;

(j) re-combining the subregions to form different subregion groups; and

(k) re-assigning the smaller clusters in each different subregion group to the subregions in said each different subregion group.

9. A process as in claim 8, further comprising the step of:

(l) repeating steps (f) to (k) until an end criterion has been reached.

10. A process as in claim 9, in which the end criterion is such that a number of the subregions has been increased above a predetermined value.

11. A process as in claim 1, in which:

each region group comprises four contiguous regions; and

each different region group comprises four contiguous regions.

12. A process as in claim 11, in which:

the region groups partially overlap; and

the different region groups partially overlap.

13. A process as in claim 12, further comprising the step of:

(f) repeating steps (d) and (e) until an end criterion has been reached.

14. A process as in claim 13, in which the region groups are combined, and the different region groups are re-combined, such that each cluster can be re-assigned to any region in step (f).

15. A process as in claim 1, in which:

step (c) comprises the substeps, for each region group, of;

(f) specifying penalties for the cells to be placed in the regions respectively;

(g) constructing an assignment of the cells to the regions;

(h) selecting a number of cells for movement between the regions;

(i) computing an optimal permutation of movement of the selected number of cells between the regions such that a cost corresponding to the total penalties for the assignment is maximally reduced; and

(j) modifying the assignment by moving the selected number of cells through the optimal permutation; and

step (e) comprises the substeps, for each different region group, of;

(k) specifying penalties for the cells to be placed in the regions respectively;

(l) constructing an assignment of the cells to the regions;

(m) selecting a number of cells for movement between the regions;

(n) computing an optimal permutation of movement of the selected number of cells between the regions such that a cost corresponding to the total penalties for the assignment is maximally reduced; and

(o) modifying the assignment by moving the selected number of cells through the optimal permutation.

16. A process as in claim 15, in which:

step (i) comprises computing the optimal permutation as starting and ending in one of the regions; and

step (n) comprises computing the optimal permutation as starting and ending in one of the regions.

17. A programmed digital computer for designing an integrated circuit chip, comprising:

memory means for storing a program including instructions and data; and

processing means for executing the program;

the processing means, memory means and program operating in combination for performing the steps of;

(a) providing a placement of clusters of cells, each cluster being assigned to one of plural pre-defined and non-overlapping regions on the chip;

(b) combining the pre-defined and non-overlapping regions to form region groups;

(c) performing a first cluster placement improvement operation within respective region groups that re-assigns the clusters in each region group to the other pre-defined and non-overlapping regions in said each region group when a cell placement cost function is reduced;

(d) re-combining the pre-defined and non-overlapping regions to form different region groups; and

(e) performing a second cluster placement improvement operation within respective different region groups that re-assigns the clusters in each different region group to the other pre-defined and non-overlapping regions in said each different region group when a cell placement cost function is reduced.

18. A programmed digital computer as in claim 17, in which:

the regions in each region group are contiguous; and

the regions in each different region group are contiguous.

19. A programmed digital computer as in claim 18, in which:

the region groups partially overlap; and

the different region groups partially overlap.

20. A programmed digital computer as in claim 19, in which the processing means, memory means and program operating in combination further perform the step of:

(f) repeating steps (d) and (e) until an end criterion has been reached.

21. A programmed digital computer as in claim 20, in which the region groups are combined, and the different region groups are re-combined, such that each cluster can be re-assigned to any region in step (f).

22. A programmed digital computer as in claim 17, in which the processing means, memory means and program operating in combination further perform the step of:

(f) repeating steps (d) and (e) until an end criterion has been reached.

23. A programmed digital computer as in claim 22, in which the processing means, memory means and program operating in combination further perform the step of:

(g) specifying interconnections for the cells, in which;

the end criterion is such that a total length of the interconnections has been reduced below a predetermined value.

24. A programmed digital computer as in claim 17, in which the processing means, memory means and program operating in combination further perform the steps of:

(f) re-clustering the cells to form smaller clusters;

(g) subdividing the regions to form subregions;

(h) combining the subregions to form subregion groups;

(i) re-assigning the smaller clusters in each subregion group to the subregions in said each subregion group;

(j) re-combining the subregions to form different subregion groups; and

(k) re-assigning the smaller clusters in each different subregion group to the subregions in said each different subregion group.

25. A programmed digital computer as in claim 24, in which the processing means, memory means and program operating in combination further perform the step of:

(l) repeating steps (f) to (k) until an end criterion has been reached.

26. A programmed digital computer as in claim 25, in which the end criterion is such that a number of the subregions has been increased above a predetermined value.

27. A programmed digital computer as in claim 17, in which:

each region group comprises four contiguous regions; and

each different region group comprises four contiguous regions.

28. A programmed digital computer as in claim 27, in which the region groups partially overlap;

and

the different region groups partially overlap.

29. A programmed digital computer as in claim 28, in which the processing means, memory means and program operating in combination further perform the step of:

(f) repeating steps (d) and (e) until an end criterion has been reached.

30. A programmed digital computer as in claim 29, in which the region groups are combined, and the different region groups are re-combined, such that each cluster can be re-assigned to any region in step (f).

31. A programmed digital computer as in claim 17, in which:

step (c) comprises the substeps, for each region group, of;

(f) specifying penalties for the cells to be placed in the regions respectively;

(g) constructing an assignment of the cells to the regions;

(h) selecting a number of cells for movement between the regions;

(i) computing an optimal permutation of movement of the selected number of cells between the regions such that a cost corresponding to the total penalties for the assignment is maximally reduced; and

(j) modifying the assignment by moving the selected number of cells through the optimal permutation; and

step (e) comprises the substeps, for each different region group, of;

(k) specifying penalties for the cells to be placed in the regions respectively;

(l) constructing an assignment of the cells to the regions;

(m) selecting a number of cells for movement between the regions;

(n) computing an optimal permutation of movement of the selected number of cells between the regions such that a cost corresponding to the total penalties for the assignment is maximally reduced; and

(o) modifying the assignment by moving the selected number of cells through the optimal permutation.

32. A programmed digital computer as in claim 31, in which:

step (i) comprises computing the optimal permutation as starting and ending in one of the regions; and

step (n) comprises computing the optimal permutation as starting and ending in one of the regions.