US7111264B2 - Process and apparatus for fast assignment of objects to a rectangle - Google Patents

Process and apparatus for fast assignment of objects to a rectangle Download PDF

Info

Publication number
US7111264B2
US7111264B2 US10/688,460 US68846003A US7111264B2 US 7111264 B2 US7111264 B2 US 7111264B2 US 68846003 A US68846003 A US 68846003A US 7111264 B2 US7111264 B2 US 7111264B2
Authority
US
United States
Prior art keywords
cost
assignment
rectangle
computer
maximal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related, expires
Application number
US10/688,460
Other versions
US20050086624A1 (en
Inventor
Alexander E. Andreev
Andrey A. Nikitin
Ranko Scepanovic
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bell Semiconductor LLC
Original Assignee
LSI Logic Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by LSI Logic Corp filed Critical LSI Logic Corp
Priority to US10/688,460 priority Critical patent/US7111264B2/en
Assigned to LSI LOGIC CORPORATION reassignment LSI LOGIC CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ANDREEV, ALEXANDER E., NIKITIN, ANDREY A., SCEPANOVIC, RANKO
Publication of US20050086624A1 publication Critical patent/US20050086624A1/en
Application granted granted Critical
Publication of US7111264B2 publication Critical patent/US7111264B2/en
Assigned to DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT reassignment DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT PATENT SECURITY AGREEMENT Assignors: AGERE SYSTEMS LLC, LSI CORPORATION
Assigned to LSI CORPORATION reassignment LSI CORPORATION CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: LSI LOGIC CORPORATION
Assigned to AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD. reassignment AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: LSI CORPORATION
Assigned to LSI CORPORATION, AGERE SYSTEMS LLC reassignment LSI CORPORATION TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS (RELEASES RF 032856-0031) Assignors: DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT
Assigned to BANK OF AMERICA, N.A., AS COLLATERAL AGENT reassignment BANK OF AMERICA, N.A., AS COLLATERAL AGENT PATENT SECURITY AGREEMENT Assignors: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
Assigned to AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD. reassignment AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD. TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Assignors: BANK OF AMERICA, N.A., AS COLLATERAL AGENT
Assigned to BELL SEMICONDUCTOR, LLC reassignment BELL SEMICONDUCTOR, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD., BROADCOM CORPORATION
Assigned to CORTLAND CAPITAL MARKET SERVICES LLC, AS COLLATERAL AGENT reassignment CORTLAND CAPITAL MARKET SERVICES LLC, AS COLLATERAL AGENT SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BELL NORTHERN RESEARCH, LLC, BELL SEMICONDUCTOR, LLC, HILCO PATENT ACQUISITION 56, LLC
Assigned to HILCO PATENT ACQUISITION 56, LLC, BELL SEMICONDUCTOR, LLC, BELL NORTHERN RESEARCH, LLC reassignment HILCO PATENT ACQUISITION 56, LLC RELEASE BY SECURED PARTY (SEE DOCUMENT FOR DETAILS). Assignors: CORTLAND CAPITAL MARKET SERVICES LLC
Adjusted expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/30Circuit design
    • G06F30/39Circuit design at the physical level
    • G06F30/392Floor-planning or layout, e.g. partitioning or placement

Definitions

  • This invention concerns placement of objects in a rectangle, and particularly to placement of cells in integrated circuit designs during creation of a floorplan.
  • the present invention is directed to a process and apparatus for assigning N objects to M points of a rectangle, where M ⁇ N.
  • the invention is particularly useful in placement of cells in an integrated circuit (IC) chip, although it is also useful in other environments where a large number of object must be placed in a space.
  • IC integrated circuit
  • Points P 1 (x 1 ,y 1 ), P 2 (x 2 ,y 2 ), . . . , P M (x M ,y M ), are the points of rectangle R.
  • Objects Q 1 (x′ 1 ,y′ 1 ), Q 2 (x′ 2 ,y′ 2 ), . . . , Q N (x′ N ,y′ N ) are the objects to be placed in rectangle R.
  • T is a set of types of points and objects.
  • ⁇ i 1 N ⁇ ⁇ C ⁇ ( i , s ⁇ ( i ) ) is the smallest possible value.
  • Kuhn's algorithm requires a considerable amount of time to execute. More particularly, execution of Kuhn's algorithm requires time defined as O(N 2 M 2 ). In practice, cell placement might require processing cell assignments for large values of parameters N and M (N,M>1000), and might be repeated many times during the design process. Consequently, execution of Kuhn's algorithm requires an unacceptable amount of time. Therefore, a need exists for a technique to quickly estimate objects assignment.
  • a process assigns objects to points of a first rectangle.
  • An initial assignment of the objects to points of the first rectangle is created.
  • the first rectangle is divided into a plurality of second, smaller rectangles.
  • An object assignment procedure is applied to the initially assigned objects in each second rectangle.
  • each point in the first rectangle is in at least two second rectangles.
  • the initial assignment of objects is performed by calculating a maximal cost of assignment of object to points, and selecting an assignment of objects having a minimum value of maximal cost. More particularly, a maximal matching assignment is calculated by iteratively recalculating the maximal matching assignment based on a midpoint of between the minimum and maximum costs of the assignment calculated during the prior iteration, and then recalculating the minimum and maximum costs of the recalculated assignment, iterating until the minimum cost is not smaller than the maximum cost.
  • the object assignment procedure comprises finding objects assigned to points of each second rectangle, applying Kuhn's algorithm of object assignment to the second rectangle, and correcting the assignment. This procedure is iteratively repeated until the assignment does not change.
  • the process is carried out in a computer under the control of a computer readable program having computer readable code that causes the computer to carry out the process.
  • FIG. 1 is a flowchart of a process of assigning objects in accordance with an embodiment of the present invention.
  • FIG. 2 is a flowchart of initial object assignment used in the process of FIG. 1 .
  • FIG. 3 is a diagram useful in explaining the process of FIG. 1 .
  • FIG. 4 is a flowchart of application of Kuhn's algorithm used in the process of FIG. 1 .
  • FIG. 1 is a flowchart of a process of object assignment in accordance with a presently preferred embodiment of the present invention.
  • the process is preferably carried out by a computer performing the process under control of a computer readable program code.
  • the costs are evaluated in accordance with the definition of costs assigned by the designer.
  • an initial assignment s(i) of objects Q i to points P j is created to achieve a minimization of the maximal cost.
  • the process of initial assignment is more fully described in connection with FIG. 2 .
  • Step 12 shown in detail in FIG. 2 , obtains an initial assignment s(i) that results from the minimization of the maximal value of the cost: max 1 ⁇ i ⁇ N (C(i,s(i))).
  • the process employs rounded costs ⁇ overscore (C) ⁇ (i,j) instead of the original costs C(i,j), where
  • LowerBound is set to 0
  • UpperBound is set to the maximal cost integer (C)
  • middle is set to the midvalue between LowerBound and UpperBound:
  • middle ⁇ LowerBound + UpperBound 2 ⁇ .
  • d ⁇ ( i , j ) ⁇ 1 if ⁇ ⁇ C _ ⁇ ( i , j ) ⁇ middle 0 if ⁇ ⁇ C _ ⁇ ( i , j ) > middle .
  • step 12 calculates a maximal matching assignment by iteratively recalculating the maximal matching assignment based on a midpoint of between the minimum and maximum costs of the assignment calculated during the prior iteration, and then recalculating the minimum and maximum costs of the recalculated assignment. The process continues to iterate until the minimum cost is not smaller than the maximum cost (i.e., LowerBound ⁇ UpperBound).
  • the technique of finding the maximal matching s(i) in the bipartional graph determined by the matrix d(i,j) is well-known. It is also well known that the time required for the solution of this problem is O(MN).
  • the process of FIG. 2 is a binary-searching algorithm for finding the value max 1 ⁇ i ⁇ N ( ⁇ overscore (C) ⁇ (i,s(i))).
  • the LowerBound and UpperBound used in the algorithm are the lower and upper bounds of the value max 1 ⁇ i ⁇ N ( ⁇ overscore (C) ⁇ (i,s(i))).
  • the number of repetitions of the steps 32 – 36 is ⁇ log 2 C ⁇ , where ⁇ log 2 C ⁇ is the minimal integer number that is not less than log 2 C. Consequently, time required to obtain the initial assignment s(i) is O(log 2 C ⁇ MN).
  • a rectangle R is split into a set of small rectangles R 1 , R 2 , . . . , R k .
  • the splitting of rectangle R can be made by any of several techniques.
  • the small rectangles R 1 , R 2 , . . . , R k has intersections such that every point of the rectangle R belongs to at least 2 small rectangles.
  • each small rectangle R 1 , R 2 , . . . , R k is examined using Kuhn's algorithm of assignment to correct the assignment s(i).
  • the procedure of step 16 is more fully described in connection with FIG. 4 .
  • Q i 1 , Q i 2 , ... ⁇ , Q i N q are those objects Q i for which s(i) ⁇ j 1 , j 2 , . . . , j M q ⁇ .
  • Kuhn's algorithm of object assignment is applied to place objects
  • step 18 determines whether the assignment s(i) was changed at step 16 . If assignment s(i) did not change at step 16 , the process continues to step 20 where the final assignment s(i) is output. If s(i) changed, the process returns to step 16 to re-define small rectangles and re-calculate Kuhn's algorithm. Each iteration uses the assignment calculated in the prior iteration, with the iterations continuing until s(i) does not change at step 18 . Hence, each iteration produces a more accurate object assignment than the prior iteration.
  • step 18 the process could continue to step 20 upon some other convenient event, such as execution of a predetermined number of iterations of the loop including step 16 , or if the assignment change by the latest iteration of step 16 is less than some predetermined amount.
  • the present invention thus provides a good estimate of the placement of objects in a rectangle, such as cells in the floorplan of an integrated circuit, in a shorter period of time than required by the Kuhn's algorithm. More particularly the time of performing the process of the present invention in a computer is the sum of the initial assignment (step 12 ) and the final assignment (step 16 ) and is

Abstract

Objects are assigned to points in a rectangle by dividing the rectangle is divided into a plurality of smaller rectangles and applying an object assignment procedure, such as Kuhn's algorithm, to initially assigned objects in each second rectangle. The initial assignment is performed by calculating a maximal cost of assignment of objects to points, and selecting an assignment of objects having a minimum value of maximal cost, identified by iteratively recalculating the maximal matching assignment based on a midpoint of between the minimum and maximum costs.

Description

FIELD OF THE INVENTION
This invention concerns placement of objects in a rectangle, and particularly to placement of cells in integrated circuit designs during creation of a floorplan.
BACKGROUND OF THE INVENTION
The present invention is directed to a process and apparatus for assigning N objects to M points of a rectangle, where M≧N. The invention is particularly useful in placement of cells in an integrated circuit (IC) chip, although it is also useful in other environments where a large number of object must be placed in a space.
Consider a rectangle having left and right edges a and b, where a<b, and bottom and top edges c and d, where c<d. The rectangle containing a point having coordinates (x,y) can be defined as R={(x,y)|a≦x≦b, c≦y≦d}.
Points P1(x1,y1), P2(x2,y2), . . . , PM(xM,yM), are the points of rectangle R. Objects Q1(x′1,y′1), Q2(x′2,y′2), . . . , QN(x′N,y′N) are the objects to be placed in rectangle R. T is a set of types of points and objects. ti is a type of a point Pi, where i is each member of the sequence of 1 to M (i={overscore (1,M)}). Thus, tiεT. t′i is a type of an object Qi, i={overscore (1,N)}, thus t′iεT. For any pair of types, u ε T and v ε T, the relation of these types TR(u,v) is such that if the object having a type v is allowed to be assigned to a point of type u, TR(u,v)=1. Otherwise, TR(u,v)=0. TR(u,u)=1 for each type u ε T.
The goal of objects assignment is to assign all objects Qi, i={overscore (1,N)} to points Ps(i) (or to find the assignment s(i) for each i={overscore (1,N)}), so that:
    • a) s(i1)≠s (i2) for any 1≦i1<i2≦N,
    • b) TR(ts(i),t′i)=1 for any i={overscore (1,N)}, and
    • c) distances between objects Qi and points Ps(i) is as small as possible.
The cost C(i,j) of assignment of an object Qi to a point Pj is denoted as follows:
C ( i , j ) = { ( x j - x i ) 2 + ( y j - y i ) 2 if TR ( t j , t i ) = 1 if TR ( t j , t i ) = 0.
One well-known technique of assigning objects is Kuhn's algorithm, which finds the optimal solution s(i) such that the sum
i = 1 N C ( i , s ( i ) )
is the smallest possible value. However, Kuhn's algorithm requires a considerable amount of time to execute. More particularly, execution of Kuhn's algorithm requires time defined as O(N2M2). In practice, cell placement might require processing cell assignments for large values of parameters N and M (N,M>1000), and might be repeated many times during the design process. Consequently, execution of Kuhn's algorithm requires an unacceptable amount of time. Therefore, a need exists for a technique to quickly estimate objects assignment.
SUMMARY OF THE INVENTION
In a first embodiment, a process assigns objects to points of a first rectangle. An initial assignment of the objects to points of the first rectangle is created. The first rectangle is divided into a plurality of second, smaller rectangles. An object assignment procedure is applied to the initially assigned objects in each second rectangle. Preferably, each point in the first rectangle is in at least two second rectangles.
In some embodiments, the initial assignment of objects is performed by calculating a maximal cost of assignment of object to points, and selecting an assignment of objects having a minimum value of maximal cost. More particularly, a maximal matching assignment is calculated by iteratively recalculating the maximal matching assignment based on a midpoint of between the minimum and maximum costs of the assignment calculated during the prior iteration, and then recalculating the minimum and maximum costs of the recalculated assignment, iterating until the minimum cost is not smaller than the maximum cost.
In other embodiments, the object assignment procedure comprises finding objects assigned to points of each second rectangle, applying Kuhn's algorithm of object assignment to the second rectangle, and correcting the assignment. This procedure is iteratively repeated until the assignment does not change.
In accordance with another embodiment of the present invention, the process is carried out in a computer under the control of a computer readable program having computer readable code that causes the computer to carry out the process.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a flowchart of a process of assigning objects in accordance with an embodiment of the present invention.
FIG. 2 is a flowchart of initial object assignment used in the process of FIG. 1.
FIG. 3 is a diagram useful in explaining the process of FIG. 1.
FIG. 4 is a flowchart of application of Kuhn's algorithm used in the process of FIG. 1.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
FIG. 1 is a flowchart of a process of object assignment in accordance with a presently preferred embodiment of the present invention. The process is preferably carried out by a computer performing the process under control of a computer readable program code. The process commences at step 10 by evaluating the costs C(i,j) of assignment of objects Qi to points Pj, where i={overscore (1,N)} and j={overscore (1,M)}. The costs are evaluated in accordance with the definition of costs assigned by the designer. At step 12, an initial assignment s(i) of objects Qi to points Pj is created to achieve a minimization of the maximal cost. The process of initial assignment is more fully described in connection with FIG. 2.
Step 12, shown in detail in FIG. 2, obtains an initial assignment s(i) that results from the minimization of the maximal value of the cost: max1≦i≦N(C(i,s(i))). In order to simplify this step the process employs rounded costs {overscore (C)}(i,j) instead of the original costs C(i,j), where
C _ ( i , j ) = { C ( i , j ) if C ( i , j ) if C ( i , j ) = ,
and where └C(i,j)┘ is the maximal integer not greater than C(i,j). For purposes of explanation, the maximal cost is designated C, C=max{overscore (C)}(i,j)≠∞ ({overscore (C)}(i,j)).
At step 30, the terms LowerBound is set to 0, UpperBound is set to the maximal cost integer (C), and middle is set to the midvalue between LowerBound and UpperBound:
    • LowerBound=0
    • UpperBound=C
middle = LowerBound + UpperBound 2 .
At step 32, the maximal matching assignment s(i) is found for matching matrix
d ( i , j ) = { 1 if C _ ( i , j ) middle 0 if C _ ( i , j ) > middle .
At step 34, if the maximal matching s(i) obtained at step 32 is determined for each i={overscore (1,N)}, such that the maximal cost is not greater than the middle (maximal cost≦middle), UpperBound is assigned to the value of middle, UpperBound=middle. Otherwise, LowerBound is assigned to the value of middle plus 1, LowerBound=middle+1.
If, at step 36, LowerBound<UpperBound, the process returns to step 32. Otherwise at step 38, the initial assignment is the maximal matching s(i) found at step 32 for the value middle=LowerBound. The assignment thus obtained is output to step 14 (FIG. 1).
The process of step 12 calculates a maximal matching assignment by iteratively recalculating the maximal matching assignment based on a midpoint of between the minimum and maximum costs of the assignment calculated during the prior iteration, and then recalculating the minimum and maximum costs of the recalculated assignment. The process continues to iterate until the minimum cost is not smaller than the maximum cost (i.e., LowerBound≧UpperBound).
The technique of finding the maximal matching s(i) in the bipartional graph determined by the matrix d(i,j) is well-known. It is also well known that the time required for the solution of this problem is O(MN). The process of FIG. 2 is a binary-searching algorithm for finding the value max1≦i≦N({overscore (C)}(i,s(i))). The LowerBound and UpperBound used in the algorithm are the lower and upper bounds of the value max1≦i≦N({overscore (C)}(i,s(i))). The number of repetitions of the steps 3236 is ┌log2C┐, where ┌log2C┐ is the minimal integer number that is not less than log2C. Consequently, time required to obtain the initial assignment s(i) is O(log2C·MN).
As shown in FIG. 1, at step 14 a rectangle R is split into a set of small rectangles R1, R2, . . . , Rk. The splitting of rectangle R can be made by any of several techniques. The small rectangles R1, R2, . . . , Rk has intersections such that every point of the rectangle R belongs to at least 2 small rectangles. FIG. 3 illustrates splitting a rectangle R into k=41 small rectangles, shown as 16 equal small rectangles in the upper portion of FIG. 3 and 25 more small portions in the lower portion of the figure. Note that the small rectangles may have different sizes.
If Mq is the number of points, Pj, j={overscore (1,M)}, that belong to a small rectangle Rq, it is evident that more powerful splitting is obtained as the number of points of rectangle Rq becomes smaller (value of max1≦q≦k (Mq) becomes smaller). If rectangle R is uniformly split, then
M q = O ( M k ) .
At step 16, each small rectangle R1, R2, . . . , Rk, is examined using Kuhn's algorithm of assignment to correct the assignment s(i). The procedure of step 16 is more fully described in connection with FIG. 4. For each small rectangle Rq at step 40, all points
P j 1 , P j 2 , , P j M q
that belong to the small rectangle Rq are considered. At step 42, all objects
Q i 1 , Q i 2 , , Q i N q
that are assigned to points
P j 1 , P j 2 , , P j M q
are located. Objects
Q i 1 , Q i 2 , , Q i N q
are those objects Qi for which s(i)ε{j1, j2, . . . , jM q }. At step 44, Kuhn's algorithm of object assignment is applied to place objects
Q i 1 , Q i 2 , , Q i N q
at points
P j 1 , P j 2 , , P j M q
and obtain an assignment s′(i). At step 46, the assignment achieved at step 12 (FIG. 12) is corrected as
s(i 1)=s′(i 1), s(i 2)=s′(i 2), . . . , s(i N q )=s′(i N q ).
The time required to perform Kuhn's algorithm to each small rectangle R1, R2, . . . , Rk at step 44 is
O ( N q 2 · M q 2 ) = O ( M 4 k 4 ) ,
so the time required to perform Kuhn's algorithm to all k small rectangles is
O ( M 4 k 3 ) ,
which is significantly shorter than the time required to apply Kuhn's algorithm of assignment to the entire rectangle R.
The process of FIG. 1 then continues to step 18 to determine whether the assignment s(i) was changed at step 16. If assignment s(i) did not change at step 16, the process continues to step 20 where the final assignment s(i) is output. If s(i) changed, the process returns to step 16 to re-define small rectangles and re-calculate Kuhn's algorithm. Each iteration uses the assignment calculated in the prior iteration, with the iterations continuing until s(i) does not change at step 18. Hence, each iteration produces a more accurate object assignment than the prior iteration. As an alternative to detecting an unchanging assignment at step 18, the process could continue to step 20 upon some other convenient event, such as execution of a predetermined number of iterations of the loop including step 16, or if the assignment change by the latest iteration of step 16 is less than some predetermined amount.
The present invention thus provides a good estimate of the placement of objects in a rectangle, such as cells in the floorplan of an integrated circuit, in a shorter period of time than required by the Kuhn's algorithm. More particularly the time of performing the process of the present invention in a computer is the sum of the initial assignment (step 12) and the final assignment (step 16) and is
O ( MN · log 2 C ) + O ( M 4 k 3 ) .
Although the present invention has been described with reference to preferred embodiments, workers skilled in the art will recognize that changes may be made in form and detail without departing from the spirit and scope of the invention.

Claims (20)

1. A process of assigning objects to points of a first rectangle comprising steps of:
a) creating an initial object assignment to points of the first rectangle with an initial assignment procedure, comprising:
a1) calculating a maximal cost of assignment of objects to points of the first rectangle, and
a2) selecting an assignment of objects having a minimum value of the maximal cost;
b) dividing the first rectangle into a plurality of second rectangles; and
c) applying an object assignment procedure, which is different than the initial object assignment procedure, to the initially assigned objects in each second rectangle.
2. The process of claim 1, wherein step a2) comprises:
calculating an initial assignment based on a relationship of cost values at each point of the first rectangle to a midvalue of the maximal cost.
3. The process of claim 2, wherein step a2) further comprises:
recalculating minimal and maximal costs based on the calculated initial assignment, and
recalculating the initial assignment based on a midvalue between the recalculated minimal and maximal costs.
4. The process of claim 3, wherein step a2) further comprises:
iteratively repeating recalculation of minimal and maximal costs and the initial assignment until the minimal cost is not smaller than the maximal cost.
5. The process of claim 1, wherein step a2) comprises:
calculating a minimum cost, maximum cost and a middle cost based on a midvalue between the minimum and maximum costs,
calculating maximal assignment for a matching matrix
d ( i , j ) = { 1 if C _ ( i , j ) middle cost 0 if C _ ( i , j ) > middle cost ,
 where {overscore (C)}(i,j) is a rounded cost value for each for assignment of i objects to j points,
if a maximal assignment is found having a cost no greater than the middle cost, reset the maximum cost equal to the middle cost, otherwise reset the lower cost to greater than the middle cost,
repeat finding maximal assignment and re-setting of minimum and maximum costs until the minimum cost≧the maximum cost.
6. The process of claim 1, wherein the dividing of the first rectangle is performed so that each point in the first rectangle is in at least two second rectangles.
7. The process of claim 1, wherein the object assignment procedure is application of Kuhn's algorithm.
8. The process of claim 1, wherein step c) comprises, for each second rectangle:
c1) finding objects assigned to points of the second rectangle, and
c2) adjusting the initial assignment of objects in the second rectangle using Kuhn's algorithm of object assignment.
9. The process of claim 8, further comprising:
iteratively repeating step c) until occurrence of a predetermined event.
10. The process of claim 1, further comprising:
iteratively repeating step c) until occurrence of a predetermined event.
11. A computer useable medium having a computer readable program embodied therein for assigning objects to points of a first rectangle, the computer readable program comprising:
first computer readable program code for causing the computer to calculate a maximal cost of assignment of objects to points to the first rectangle and create an initial object assignment to points of the first rectangle, which has a minimum value of the maximal cost;
second computer readable program code for causing the computer to divide the first rectangle into a plurality of second rectangles; and
third computer readable program code for causing the computer to create an object assignment of the initially assigned objects in each second rectangle to points in the second rectangle, using an object assignment algorithm that is different than that used to create the initial object assignment.
12. The computer useable medium of claim 11, wherein the first computer readable program code comprises:
computer readable program code for causing the computer to calculate an initial assignment for a matching matrix that is based on a relationship of cost values at each point of the first rectangle to a midvalue of the maximal cost.
13. The computer useable medium of claim 12, wherein the first computer readable program code further comprises:
computer readable program code for causing the computer to recalculate minimal and maximal costs based on the calculated initial assignment, and
computer readable program code for causing the computer to recalculate the initial assignment based on a midvalue between the recalculated minimal and maximal costs.
14. The computer useable medium of claim 13, wherein the first computer readable program code further comprises:
computer readable program code for causing the computer to iteratively repeat recalculation of minimal and maximal costs and the initial assignment until the minimal cost is not smaller than the maximal cost.
15. The computer useable medium of claim 11, wherein the first computer readable program code comprises:
computer readable program code for causing the computer to calculate a minimum cost, a maximum cost and a middle cost based on a midvalue between the minimum and maximum costs,
computer readable program code for causing the computer to calculate a maximal assignment for a matching matrix
d ( i , j ) = { 1 if C _ ( i , j ) middle cost 0 if C _ ( i , j ) > middle cost ,
 where {overscore (C)}(i,j) is a rounded cost value for each for the assignment of i objects to j points,
computer readable program code for causing the computer to reset the maximum cost equal to the middle cost if the maximal assignment has a cost not greater than the middle cost, and to reset the minimum cost to an amount greater than the middle cost if the maximal assignment has a cost greater than the minimum cost, and
computer readable program code for causing the computer to iteratively repeat calculating the maximal assignment and re-setting the minimum and maximum costs until the minimum cost is not smaller than the maximum cost.
16. The computer useable medium of claim 14, wherein the computer readable program code that causes the computer to divide of the first rectangle causes the computer to place each point of the first rectangle in at least two second rectangles.
17. The computer useable medium of claim 14, wherein the third computer readable program code causes the computer to execute Kuhn's algorithm.
18. The computer useable medium of claim 14, wherein the third computer readable program code comprises, for each second rectangle:
computer readable program code for causing the computer to find objects assigned to points of the second rectangle, and
computer readable program code for causing the computer to execute Kuhn's algorithm to re-calculate the assignment of objects in the second rectangle.
19. The computer useable medium of claim 18, further comprising:
computer readable program code for causing the computer to iteratively repeat execution of the computer readable program code for executing Kuhn's algorithm until occurrence of a predetermined event.
20. A process of assigning objects to points of a first rectangle comprising steps of:
a) creating an initial object assignment to points of the first rectangle with an initial assignment procedure, comprising:
b) dividing the first rectangle into a plurality of second rectangles so that each point in the first rectangle is in at least two second rectangles; and
c) applying an object assignment procedure, which is different than the initial object assignment procedure, to the initially assigned objects in each second rectangle.
US10/688,460 2003-10-17 2003-10-17 Process and apparatus for fast assignment of objects to a rectangle Expired - Fee Related US7111264B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US10/688,460 US7111264B2 (en) 2003-10-17 2003-10-17 Process and apparatus for fast assignment of objects to a rectangle

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10/688,460 US7111264B2 (en) 2003-10-17 2003-10-17 Process and apparatus for fast assignment of objects to a rectangle

Publications (2)

Publication Number Publication Date
US20050086624A1 US20050086624A1 (en) 2005-04-21
US7111264B2 true US7111264B2 (en) 2006-09-19

Family

ID=34521177

Family Applications (1)

Application Number Title Priority Date Filing Date
US10/688,460 Expired - Fee Related US7111264B2 (en) 2003-10-17 2003-10-17 Process and apparatus for fast assignment of objects to a rectangle

Country Status (1)

Country Link
US (1) US7111264B2 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060230375A1 (en) * 2005-04-06 2006-10-12 Lsi Logic Corporation Integrated circuit with relocatable processor hardmac
US20070094633A1 (en) * 2005-10-24 2007-04-26 Andreev Alexander E Method and system for mapping netlist of integrated circuit to design

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7149993B1 (en) * 2004-03-29 2006-12-12 Xilinx, Inc. Method, system, and apparatus for incremental design in programmable logic devices using floorplanning

Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5535134A (en) 1994-06-03 1996-07-09 International Business Machines Corporation Object placement aid
US5818729A (en) * 1996-05-23 1998-10-06 Synopsys, Inc. Method and system for placing cells using quadratic placement and a spanning tree model
US6014506A (en) 1995-10-31 2000-01-11 Vlsi Technology, Inc. Method and apparatus for improving engineering change order placement in integrated circuit designs
US6134702A (en) * 1997-12-16 2000-10-17 Lsi Logic Corporation Physical design automation system and process for designing integrated circuit chips using multiway partitioning with constraints
US6189132B1 (en) 1998-04-09 2001-02-13 International Business Machines Corporation Design rule correction system and method
US6292929B2 (en) * 1996-06-28 2001-09-18 Lsi Logic Corporation Advanced modular cell placement system
US6415425B1 (en) 1999-03-04 2002-07-02 Xilinx, Inc. Method for analytical placement of cells using density surface representations
US20030163795A1 (en) 2002-02-27 2003-08-28 Morgan David A. Method of repeater insertion for hierarchical integrated circuit design
US20030188274A1 (en) 2002-03-27 2003-10-02 Gasanov Elyar E. Floor plan tester for integrated circuit design
US6637016B1 (en) 2001-04-25 2003-10-21 Lsi Logic Corporation Assignment of cell coordinates
US6650046B2 (en) 2000-11-17 2003-11-18 Tdk Corporation Thin-film EL device, and its fabrication process
US6725432B2 (en) 1998-09-30 2004-04-20 Cadence Design Systems, Inc. Blocked based design methodology
US6748574B2 (en) * 2001-03-14 2004-06-08 Fujitsu Limited Method of and apparatus for determining an optimal solution to a uniform-density layout problem, and medium on which a program for determining the solution is stored
US20040166864A1 (en) * 2001-03-28 2004-08-26 Stephen Hill Minimising signal interference within a wireless network
US20050038728A1 (en) * 2003-08-11 2005-02-17 Pierfrancesco La Mura Double auctions with bargaining
US20050091625A1 (en) 2003-10-27 2005-04-28 Lsi Logic Corporation Process and apparatus for placement of cells in an IC during floorplan creation

Patent Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5535134A (en) 1994-06-03 1996-07-09 International Business Machines Corporation Object placement aid
US6014506A (en) 1995-10-31 2000-01-11 Vlsi Technology, Inc. Method and apparatus for improving engineering change order placement in integrated circuit designs
US5818729A (en) * 1996-05-23 1998-10-06 Synopsys, Inc. Method and system for placing cells using quadratic placement and a spanning tree model
US6292929B2 (en) * 1996-06-28 2001-09-18 Lsi Logic Corporation Advanced modular cell placement system
US6134702A (en) * 1997-12-16 2000-10-17 Lsi Logic Corporation Physical design automation system and process for designing integrated circuit chips using multiway partitioning with constraints
US6189132B1 (en) 1998-04-09 2001-02-13 International Business Machines Corporation Design rule correction system and method
US6725432B2 (en) 1998-09-30 2004-04-20 Cadence Design Systems, Inc. Blocked based design methodology
US6415425B1 (en) 1999-03-04 2002-07-02 Xilinx, Inc. Method for analytical placement of cells using density surface representations
US6650046B2 (en) 2000-11-17 2003-11-18 Tdk Corporation Thin-film EL device, and its fabrication process
US6748574B2 (en) * 2001-03-14 2004-06-08 Fujitsu Limited Method of and apparatus for determining an optimal solution to a uniform-density layout problem, and medium on which a program for determining the solution is stored
US20040166864A1 (en) * 2001-03-28 2004-08-26 Stephen Hill Minimising signal interference within a wireless network
US6637016B1 (en) 2001-04-25 2003-10-21 Lsi Logic Corporation Assignment of cell coordinates
US20030163795A1 (en) 2002-02-27 2003-08-28 Morgan David A. Method of repeater insertion for hierarchical integrated circuit design
US20030188274A1 (en) 2002-03-27 2003-10-02 Gasanov Elyar E. Floor plan tester for integrated circuit design
US20050038728A1 (en) * 2003-08-11 2005-02-17 Pierfrancesco La Mura Double auctions with bargaining
US20050091625A1 (en) 2003-10-27 2005-04-28 Lsi Logic Corporation Process and apparatus for placement of cells in an IC during floorplan creation

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060230375A1 (en) * 2005-04-06 2006-10-12 Lsi Logic Corporation Integrated circuit with relocatable processor hardmac
US7313775B2 (en) * 2005-04-06 2007-12-25 Lsi Corporation Integrated circuit with relocatable processor hardmac
US20070094633A1 (en) * 2005-10-24 2007-04-26 Andreev Alexander E Method and system for mapping netlist of integrated circuit to design
US7404166B2 (en) * 2005-10-24 2008-07-22 Lsi Corporation Method and system for mapping netlist of integrated circuit to design

Also Published As

Publication number Publication date
US20050086624A1 (en) 2005-04-21

Similar Documents

Publication Publication Date Title
US7062743B2 (en) Floorplan evaluation, global routing, and buffer insertion for integrated circuits
While et al. A faster algorithm for calculating hypervolume
US6611951B1 (en) Method for estimating cell porosity of hardmacs
US6308299B1 (en) Method and system for combinational verification having tight integration of verification techniques
RU2004120678A (en) METHODS FOR DETERMINING AN APPROXIMATE LOCATION OF A DEVICE BASED ON EXTERNAL SIGNALS
Pfeiler et al. Dörfler marking with minimal cardinality is a linear complexity problem
Moshkovitz Parallel repetition from fortification
Schreiber et al. Cut size statistics of graph bisection heuristics
Brugger et al. Mixed precision multilevel Monte Carlo on hybrid computing systems
CN111310290A (en) Method and device for community division of nodes and computer readable storage medium
US7111264B2 (en) Process and apparatus for fast assignment of objects to a rectangle
Guo et al. Approximately counting bases of bicircular matroids
Tian et al. Two-stage stochastic Runge-Kutta methods for stochastic differential equations
US6557159B1 (en) Method for preserving regularity during logic synthesis
CN108664593A (en) Data consistency verification method, device, storage medium and electronic equipment
Leydold et al. A sweep-plane algorithm for generating random tuples in simple polytopes
US7117456B2 (en) Circuit area minimization using scaling
US6278898B1 (en) Model error bounds for identification of stochastic models for control design
US20080010329A1 (en) Method and computer program product for circuit analysis and circuit simulation device
Mrazek et al. EvoApproxLib: Extended library of approximate arithmetic circuits
US7551786B2 (en) System and method for efficient non-overlapping partitioning of rectangular regions of interest in multi-channel detection
US7313778B1 (en) Method system and apparatus for floorplanning programmable logic designs
US6609234B2 (en) Ordering binary decision diagrams used in the formal equivalence verification of digital designs
US6671656B2 (en) Structure analysis method and program, and recording medium thereof
Lukarski et al. Hybrid multi-elimination ILU preconditioners on GPUs

Legal Events

Date Code Title Description
AS Assignment

Owner name: LSI LOGIC CORPORATION, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ANDREEV, ALEXANDER E.;NIKITIN, ANDREY A.;SCEPANOVIC, RANKO;REEL/FRAME:014632/0017;SIGNING DATES FROM 20031013 TO 20031015

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

AS Assignment

Owner name: DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AG

Free format text: PATENT SECURITY AGREEMENT;ASSIGNORS:LSI CORPORATION;AGERE SYSTEMS LLC;REEL/FRAME:032856/0031

Effective date: 20140506

AS Assignment

Owner name: LSI CORPORATION, CALIFORNIA

Free format text: CHANGE OF NAME;ASSIGNOR:LSI LOGIC CORPORATION;REEL/FRAME:033102/0270

Effective date: 20070406

AS Assignment

Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:LSI CORPORATION;REEL/FRAME:035390/0388

Effective date: 20140814

AS Assignment

Owner name: LSI CORPORATION, CALIFORNIA

Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS (RELEASES RF 032856-0031);ASSIGNOR:DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT;REEL/FRAME:037684/0039

Effective date: 20160201

Owner name: AGERE SYSTEMS LLC, PENNSYLVANIA

Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS (RELEASES RF 032856-0031);ASSIGNOR:DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT;REEL/FRAME:037684/0039

Effective date: 20160201

AS Assignment

Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH CAROLINA

Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.;REEL/FRAME:037808/0001

Effective date: 20160201

Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH

Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.;REEL/FRAME:037808/0001

Effective date: 20160201

AS Assignment

Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD., SINGAPORE

Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNOR:BANK OF AMERICA, N.A., AS COLLATERAL AGENT;REEL/FRAME:041710/0001

Effective date: 20170119

Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD

Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNOR:BANK OF AMERICA, N.A., AS COLLATERAL AGENT;REEL/FRAME:041710/0001

Effective date: 20170119

AS Assignment

Owner name: BELL SEMICONDUCTOR, LLC, ILLINOIS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.;BROADCOM CORPORATION;REEL/FRAME:044887/0109

Effective date: 20171208

AS Assignment

Owner name: CORTLAND CAPITAL MARKET SERVICES LLC, AS COLLATERA

Free format text: SECURITY INTEREST;ASSIGNORS:HILCO PATENT ACQUISITION 56, LLC;BELL SEMICONDUCTOR, LLC;BELL NORTHERN RESEARCH, LLC;REEL/FRAME:045216/0020

Effective date: 20180124

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.)

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20180919

AS Assignment

Owner name: BELL NORTHERN RESEARCH, LLC, ILLINOIS

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CORTLAND CAPITAL MARKET SERVICES LLC;REEL/FRAME:059720/0223

Effective date: 20220401

Owner name: BELL SEMICONDUCTOR, LLC, ILLINOIS

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CORTLAND CAPITAL MARKET SERVICES LLC;REEL/FRAME:059720/0223

Effective date: 20220401

Owner name: HILCO PATENT ACQUISITION 56, LLC, ILLINOIS

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CORTLAND CAPITAL MARKET SERVICES LLC;REEL/FRAME:059720/0223

Effective date: 20220401