Optimized corner turns for local storage and bandwidth reduction
AssigneeInternational Business Machines Corporation
InventorsDaniel A. Brokenshire, John A. Gunnels, Michael D. Kistler
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsDaniel A. Brokenshire, John A. Gunnels, Michael D. Kistler
Estimating the term…
A block matrix multiplication mechanism is provided for reversing the visitation order of blocks at corner turns when performing a block matrix multiplication operation in a data processing system. By reversing the visitation order, the mechanism eliminates a block load at the corner turns. In accordance with the illustrative embodiment, a corner return is referred to as a “bounce” corner turn and results in a serpentine patterned processing order of the matrix blocks. The mechanism allows the data processing system to perform a block matrix multiplication operation with a maximum of three block transfers per time step. Therefore, the mechanism reduces maximum throughput and increases performance. In addition, the mechanism also reduces the number of multi-buffered local store buffers.
A method, in a data processing system, for optimized corner turns for local storage and bandwidth reduction, the method comprising:
Dependencies are inferred from the claim text.