Method and apparatus for pre-computing placement costs
First Claim
1. A method of pre-computing costs of placing circuit modules in regions of circuit layouts, the method comprising:
- a) defining a set of partitioning lines for partitioning the region into a plurality of sub-regions during a placement operation;
b) for each set of potential sub-regions, identifying a connection graph that traverses the set of potential sub-regions, wherein some of the connection graphs have edges that are at least partially diagonal;
c) identifying an attribute of each identified connection graph;
d) for each set of potential sub-regions, storing the attribute of the connection graph identified for the set.
2 Assignments
0 Petitions
Accused Products
Abstract
Some embodiments of the invention provide a method that pre-computes costs of placing circuit modules in regions of circuit layouts. The method defines a set of partitioning lines for partitioning the region into a plurality of sub-regions during a placement operation. For each set of potential sub-regions, the method identifies a connection graph that traverses the set of potential sub-regions. Some of the connection graphs have edges that are at least partially diagonal. The method then identifies an attribute of each identified connection graph. For each set of potential sub-regions, the method then stores the identified attribute of the connection graph that is identified for the set.
-
Citations
15 Claims
-
1. A method of pre-computing costs of placing circuit modules in regions of circuit layouts, the method comprising:
-
a) defining a set of partitioning lines for partitioning the region into a plurality of sub-regions during a placement operation;
b) for each set of potential sub-regions, identifying a connection graph that traverses the set of potential sub-regions, wherein some of the connection graphs have edges that are at least partially diagonal;
c) identifying an attribute of each identified connection graph;
d) for each set of potential sub-regions, storing the attribute of the connection graph identified for the set. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. For a placer that partitions a region of a circuit layout into a plurality of sub-regions, a method of computing placement costs, the method comprising:
-
a) for a set of sub-regions, identifying a connection graph that connects the set of sub-regions, wherein the connection graph has at least one edge that is at least partially diagonal;
b) identifying a placement cost from an attribute of the connection graph;
c) storing the placement cost for the set of sub-regions. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15)
-
Specification