Optimizing placement of circuit resources using a globally accessible placement memory
First Claim
1. A method, executed by one or more processors, for optimizing placement of a logic network, the method comprising:
- determining, by the one or more processors, a resource for placement and a desired location for the resource;
reserving, by the one or more processors, via a placement memory, a plurality of potential locations for the logic element that are proximate to the desired location;
determining, by the one or more processors, a best location from the plurality of potential locations; and
placing, by the one or more processors, the logic element at the best location.
1 Assignment
0 Petitions
Accused Products
Abstract
A method, executed by one or more processors, for optimizing placement of a logic network, includes partitioning a logic network into a set of logic partitions, launching a set of placement optimization threads that correspond to the logic partitions, and allocating memory that is accessible to the placement optimization threads to provide a globally accessible placement memory for reserving placement locations on the integrated circuit. Each placement optimization thread may be configured to conduct the operations of determining a desired location for a logic element, reserving a set of potential locations for the logic element, determining a best location from the set of potential locations, and placing the logic element to the best location. Each placement optimization thread may also be configured to release each of the potential locations that are not the best location. A corresponding computer program product and computer system are also disclosed herein.
-
Citations
20 Claims
-
1. A method, executed by one or more processors, for optimizing placement of a logic network, the method comprising:
-
determining, by the one or more processors, a resource for placement and a desired location for the resource; reserving, by the one or more processors, via a placement memory, a plurality of potential locations for the logic element that are proximate to the desired location; determining, by the one or more processors, a best location from the plurality of potential locations; and placing, by the one or more processors, the logic element at the best location. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer program product for optimizing placement of a logic network, the computer program product comprising:
-
at least one computer readable storage medium that is not a transitory signal per se and program instructions stored on the at least one computer readable storage medium, the program instructions comprising instructions to perform operations comprising; determining a resource for placement and a desired location for the resource; reserving, via a placement memory, a plurality of potential locations for the logic element that are proximate to the desired location; determining a best location from the plurality of potential locations; and placing the logic element at the best location. - View Dependent Claims (10, 11, 12, 13, 14, 15)
-
-
16. A computer system for optimizing placement of a logic network, the computer system comprising:
-
one or more computers; at least one computer readable storage medium that is not a transitory signal per se and program instructions stored on the at least one computer readable storage medium, the program instructions comprising instructions to perform operations comprising; determining a resource for placement and a desired location for the resource; reserving, via a placement memory, a plurality of potential locations for the logic element that are proximate to the desired location; determining a best location from the plurality of potential locations; and placing the logic element at the best location. - View Dependent Claims (17, 18, 19, 20)
-
Specification