Cyclic preloading mechanism to define swap-out ordering for round robin cache memory
AssigneeInternational Business Machines Corporation
InventorJun Doi
Life of this patent
Estimating the term…
Abstract
A computer-implemented method is provided for managing a cache operatively coupled to at least one processor. Round robin swap-out ordering is used for the cache. The method includes dividing a set of data regions accessed by a calculation into data blocks. A size of the data blocks is less than a size of the data regions. The method further includes cyclically queuing the data blocks from the data regions into a FIFO before an actual use of the data regions by the calculation. The method also includes cyclically preloading the data blocks of a data region to be processed from the FIFO into the cache before the actual use of the data regions by the calculation.
Claims20
A computer-implemented method for managing a cache operatively coupled to at least one processor, wherein round robin swap-out ordering is used for the cache, the method comprising:
- dividing a set of data regions accessed by a calculation into data blocks, wherein a size of the data blocks is less than a size of the data regions;
- cyclically queuing the data blocks from the data regions into a FIFO before an actual use of the data regions by the calculation;
- and
- cyclically preloading the data blocks of a data region to be processed from the FIFO into the cache before the actual use of the data regions by the calculation.
A computer program product for managing a cache operatively coupled to at least one processor, wherein round robin swap-out ordering is used for the cache, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform a method comprising:
- dividing a set of data regions accessed by a calculation into data blocks, wherein a size of the data blocks is less than a size of the data regions;
- cyclically queuing the data blocks from the data regions into a FIFO before an actual use of the data regions by the calculation;
- and
- cyclically preloading the data blocks of a data region to be processed from the FIFO into the cache before the actual use of the data regions by the calculation.
Dependencies are inferred from the claim text.