Fast cache tracking to support aggressive prefetching

    公开(公告)号:GB2604205A

    公开(公告)日:2022-08-31

    申请号:GB202114291

    申请日:2021-10-06

    Applicant: IBM

    Abstract: A method, comprises predicting a candidate address, calculating a hash of the candidate address, checking a first Bloom filter based on the hash, and determining, based on the checking, to prefetch information stored at the candidate address. The predicting may include predicting a second candidate address, calculating a second hash of the second candidate address, checking the first Bloom filter based on the second hash, and determining, based on the checking, that prefetching second information stored at the second candidate address is unnecessary. The predicting may also include determining a first address of a cache hit and determining the candidate address based on the first address. The checking may include comparing the first Bloom filter and a second Bloom filter, generating a result vector based on the comparison, and checking the result vector. The method may include detecting a cache write and updating, based on the hash, a value of the first Bloom filter and the second Bloom filter, e.g. incrementing the value. The method may further comprise periodically flushing the first Bloom filter and the second Bloom filter, wherein the flushing of the first Bloom filter is offset from the flushing of the second Bloom filter.

Patent Agency Ranking