Set-associative cache memory having variable time decay rewriting algorithm
AssigneeTensilica, Inc.
InventorsMarc Alan Evans, Pavlos Konas
Life of this patent
Estimating the term…
Loading patent…
AssigneeTensilica, Inc.
InventorsMarc Alan Evans, Pavlos Konas
Estimating the term…
A set-associative structure replacement algorithm is particularly beneficial for irregular set-associative structures which may be affected by different access patterns, and different associativities available to be replaced on any given access. According to certain aspects, methods and apparatuses implement a novel decay replacement algorithm that is particularly beneficial for irregular set-associative structures. An embodiment apparatus includes set-associative structures having decay information stored therein, as well as update/replacement logic to implement replacement algorithms for translation lookup buffers (TLBS) and caches that vary in the number of associativities; have unbalanced associativity sizes, e.g., associativities can have different numbers of indices; and can have varying replacement criteria. The implementation apparatuses and methods provide good performance, on the level of LRU, random and clock algorithms; and is efficient and scalable.
A method of updating replacement information in a cache memory having a plurality of entries, the entries arranged in a plurality of ways, the method comprising:
A method of replacing data in a cache memory upon a cache miss, the method comprising:
A method of maintaining a cache memory, the cache memory comprising a plurality of entries arranged in a plurality of ways, the method comprising:
A cache memory comprising:
A cache memory comprising:
A cache memory comprising:
Dependencies are inferred from the claim text.