Buffer Fusion and Layout Optimization

A non-transitory computer readable storage medium storing computer program instructions to optimize buffer allocation in a contiguous area of an array of reconfigurable units including at least a first physical memory unit and a second physical memory unit, wherein the computer program instructions, when executed on a processor, implement a method comprising:

• temporarily assigning a first buffer portion comprising at least a part of a first buffer to the first physical memory unit and a second buffer portion comprising at least a part of a second buffer to the second physical memory unit;
• temporarily routing connections between the first physical memory unit, the second physical memory unit, and previously mapped reconfigurable units within the contiguous area;
• using a cost function to calculate a first cost related to assigning the first buffer portion and the second buffer portion to the first physical memory unit and the second physical memory unit;
• determining one or more candidate third physical memory units within the contiguous area, wherein the size of each candidate third physical memory unit is larger than the size of the first buffer portion plus the size of the second buffer portion;
• initializing a best cost and initializing a best candidate physical memory unit;
• for each candidate third physical memory unit:
• temporarily reassigning the first buffer portion and the second buffer portion to the candidate third physical memory unit, temporarily routing connections between the candidate third physical memory unit and previously mapped reconfigurable units within the contiguous area, and using the cost function to calculate a second cost related to assigning the first buffer portion and the second buffer portion to the candidate third physical memory unit;
• determining if the second cost is better than the best cost;
• updating, in response to determining that the second cost is better than the best cost, the best cost to equal the second cost, and the best candidate physical memory unit to equal the candidate third physical memory unit;
• and
• assigning both the first buffer portion and the second buffer portion to the best candidate physical memory unit.

A system including one or more processors coupled to a memory, the memory loaded with computer program instructions to optimize buffer allocation in a contiguous area of an array of reconfigurable units including at least a first physical memory unit and a second physical memory unit, wherein the computer program instructions, when executed on the one or more processors, implement actions comprising:

• temporarily assigning a first buffer portion comprising at least a part of a first buffer to the first physical memory unit and a second buffer portion comprising at least a part of a second buffer to the second physical memory unit;
• temporarily routing connections between the first physical memory unit, the second physical memory unit, and previously mapped reconfigurable units within the contiguous area;
• using a cost function to calculate a first cost related to assigning the first buffer portion and the second buffer portion to the first physical memory unit and the second physical memory unit;
• determining one or more candidate third physical memory units within the contiguous area, wherein the size of each candidate third physical memory unit is larger than the size of the first buffer portion plus the size of the second buffer portion;
• initializing a best cost and initializing a best candidate physical memory unit;
• for each candidate third physical memory unit:
• temporarily reassigning the first buffer portion and the second buffer portion to the candidate third physical memory unit, temporarily routing connections between the candidate third physical memory unit and previously mapped reconfigurable units within the contiguous area, and using the cost function to calculate a second cost related to assigning the first buffer portion and the second buffer portion to the candidate third physical memory unit;
• determining if the second cost is better than the best cost;
• updating, in response to determining that the second cost is better than the best cost, the best cost to equal the second cost, and the best candidate physical memory unit to equal the candidate third physical memory unit;
• and
• assigning both the first buffer portion and the second buffer portion to the best candidate physical memory unit.