Optimizing placement of circuit resources using a globally accessible placement memory

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:
• partition a logic network comprising a plurality of logic elements into a plurality of logic partitions;
• launch a plurality of placement optimization threads that correspond to the plurality of logic partitions;
• allocate memory that is accessible to the plurality of placement optimization threads to provide a globally accessible placement memory;
• reserve a placement location for at least a portion of the plurality of logic elements via the globally accessible placement memory;
• and
• wherein the program instructions comprise instructions for each placement optimization thread of the plurality of placement optimization threads to conduct the operations of:
• determining a desired location for a logic element of the plurality of logic elements,
• reserving, via the globally accessible 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.

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:
• partition a logic network comprising a plurality of logic elements into a plurality of logic partitions;
• launch a plurality of placement optimization threads that correspond to the plurality of logic partitions;
• allocate memory that is accessible to the plurality of placement optimization threads to provide a globally accessible placement memory;
• reserve a placement location for at least a portion of the plurality of logic elements via the globally accessible placement memory;
• and
• wherein the program instructions comprise instructions for each placement optimization thread of the plurality of placement optimization threads to conduct the operations of:
• determining a desired location for a logic element of the plurality of logic elements,
• reserving, via the globally accessible 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,
• releasing each of the plurality of potential locations that are not the best location, and
• placing the logic element at the best location.