OPTIMIZING PLACEMENT OF CIRCUIT RESOURCES USING A GLOBALLY ACCESSIBLE PLACEMENT MEMORY

• US 20160300006A1
• Filed: 06/21/2016
• Published: 10/13/2016
• Est. Priority Date: 03/24/2015
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hathaway, David J., Hieter, Nathaniel D., Ramji, Shyam, Suess, Alexander J.
• Granted Patent: US 9,703,914 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 2111/02 CAD in a network environment, e.g. collaborative CAD or distributed simulation
• CPC Class Codes: G06F 30/327 Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
• CPC Class Codes: G06F 30/33 Design verification, e.g. functional simulation or model checking
• CPC Class Codes: G06F 30/392 Floor-planning or layout, e.g. partitioning or placement
• CPC Class Codes: G06F 30/398 Design verification or optimisation, e.g. using design rule check [DRC], layout versus schematics [LVS] or finite element methods [FEM] optical proximity correction [OPC] design processes G03F1/36

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.

Claims

1. A method, executed by one or more processors, for optimizing placement of a logic network, the method comprising:

determining a resource for placement and a desired location the resource;

reserving, via a placement memory accessible to a plurality of placement optimization threads, 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.

2. The method of claim 1, wherein reserving a potential location comprises inserting a thread identifier within at least one entry of an owning thread array stored within the globally accessible placement memory.

3. The method of claim 1, wherein reserving a potential location comprises inserting at least one bit within a reserved locations bitmap stored within the globally accessible placement memory.

4. The method of claim 1, wherein reserving a potential location comprises locking and unlocking at least a portion of the globally accessible placement memory.

5. The method of claim 1, wherein each placement optimization thread of the plurality of placement optimization threads is configured to free a placement location for a deleted logic element via the globally accessible placement memory.

6. The method of claim 1, wherein each placement optimization thread of the plurality of placement optimization threads is configured to reserve a placement location for an added logic element via the globally accessible placement memory.

7. The method of claim 1, wherein the logic element is within a logic partition that corresponds to the placement optimization thread.

8. The method of claim 1, further comprising releasing each of the plurality of potential locations that are not the best location.

9. A computer program product for optimizing placement of a logic network, the computer program product comprising:

one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising instructions to perform;

determining a resource for placement and a desired location the resource;

reserving, via a placement memory accessible to a plurality of placement optimization threads, 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.

10. The computer program product of claim 9, wherein reserving a potential location comprises inserting a thread identifier within at least one entry of an owning thread array stored within the globally accessible placement memory.

11. The computer program product of claim 9, wherein reserving a potential location comprises inserting at least one bit within a reserved locations bitmap stored within the globally accessible placement memory.

12. The computer program product of claim 9, wherein reserving a potential location comprises locking and unlocking at least a portion of the globally accessible placement memory.

13. The computer program product of claim 9, wherein the operations further comprise freeing a placement location for a deleted logic element via the globally accessible placement memory.

14. The computer program product of claim 9, wherein the operations further comprise reserving a placement location for an added logic element via the globally accessible placement memory.

15. The computer program product of claim 9, wherein the operations further comprise releasing each of the plurality of potential locations that are not the best location.

16. A computer system for optimizing placement of a logic network, the computer system comprising:

one or more computers;

one or more computer readable storage media and program instructions stored on the one or more computer readable storage media for execution by at least one of the computers, the program instructions comprising instructions to perform;

determining a resource for placement and a desired location the resource;

reserving, via a placement memory accessible to a plurality of placement optimization threads, 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.

17. The computer system of claim 16, wherein reserving a potential location comprises inserting a thread identifier within at least one entry of an owning thread array stored within the globally accessible placement memory.

18. The computer system of claim 16, wherein reserving a potential location comprises inserting at least one bit within a reserved locations bitmap stored within the globally accessible placement memory.

19. The computer system of claim 16, wherein reserving a potential location comprises locking and unlocking at least a portion of the globally accessible placement memory.

20. The computer system of claim 16, wherein the operations further comprise freeing a placement location for a deleted logic element via the globally accessible placement memory.