×

Dynamic prioritization of cache access

  • US 9,563,559 B2
  • Filed: 05/21/2014
  • Issued: 02/07/2017
  • Est. Priority Date: 12/12/2011
  • Status: Active Grant
First Claim
Patent Images

1. A method comprising:

  • determining, via at least one of one or more processors, that a memory access request to a computer memory results in a cache miss;

    determining, over a number of clock cycles, a count of additional cache misses that occurred with a period prior to the cache miss;

    comparing the count of the additional cache misses to a tolerance value that corresponds to reservation of a given amount of a plurality of cache state machines available for potential cache hits;

    determining, via at least one of the one or more processors, an amount of cache resources used to service the additional cache misses that occurred within the period prior to the cache miss based on the comparing the count of the additional cache misses to the tolerance value, and based on one or more of one or more values derived from a count of cache hits within the period prior to the cache miss or a limit of a plurality of cache state machines to be used to concurrently service cache misses; and

    servicing the memory access request based, at least in part, on the amount of cache resources used to service the additional cache misses within the period prior to the cache miss, wherein the servicing the memory access request comprises, in response to the comparing, determining to either reject the memory access request or perform a plurality of cache coherence operations in accordance with the cache miss.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×