Least recently used (LRU) cache replacement implementation using a FIFO storing indications of whether a way of the cache was most recently accessed
A method and apparatus for calculating a victim way that is always the least recently used way. More specifically, in an m-set, n-way set associative cache, each way in a cache set comprises a valid bit that indicates that the way contains valid data. The valid bit is set when a way is written and cleared upon being invalidated, e.g., via a snoop address, The cache system comprises a cache LRU circuit which comprises an LRU logic unit associated with each cache set. The LRU logic unit comprises a FIFO of n-depth (in certain embodiments, the depth corresponds to the number of ways in the cache) and m-width. The FIFO performs push, pop and collapse functions. Each entry in the FIFO contains the encoded way number that was last accessed.
1. A memory system comprising:
a memory array, the memory array comprising a plurality of portions and a plurality of sections, the portions corresponding to ways within the memory array and sections corresponding to sets within the memory array; and,
a memory controller, the memory controller comprising a least recently used (LRU) circuit, the LRU circuit comprising a plurality of first in first out (FIFO) circuits, each of the plurality of FIFO circuits storing indications of a respective portion of the plurality of portions in an order based upon whether the respective portion of the plurality of portions was most recently accessed; and wherein
each of the plurality of FIFO circuits is configured to perform a collapse function based upon the indications of a respective portion of the plurality of portions in the order based upon whether the respective portion of the plurality of portions was most recently accessed, the collapse function allowing each of the plurality of FIFO circuits to provide a true LRU function to the LRU circuit such that a victim portion is always a last recently used portion.
2. The memory system of claim 1 wherein:
at least one of a pop function and a collapse function is performed by the FIFO circuit when a portion is invalidated.
3. The memory system of claim 1 wherein:
a push function is performed by the FIFO circuit when an invalid portion is written; and,
a push and collapse function is performed by the FIFO circuit simultaneously and together when a valid portion is read or written.
4. The memory system of claim 3 wherein:
each entry in the FIFO comprises a portion number indication relating to when the portion stored within the entry was last accessed.
5. The memory system of claim 1 wherein:
each portion of the cache comprises a valid bit, the valid bit indicating that a portion of the cache comprises valid data, the valid bit being set when the portion is written and cleared upon being invalidated.
6. The memory system of claim 1 wherein:
the memory array comprises an m-set, n-way set associative cache;
the memory controller comprises m LRU circuits corresponding to each set of the memory array.
7. The memory system of claim 6 wherein:
each of the m LRU circuits comprise a respective first in first out (FIFO) circuit, each FIFO circuit being of n-depth, each FIFO circuit storing at least some of the plurality of ways in an order based upon whether a way of the plurality of ways was most recently accessed.
8. The memory system of claim 7 wherein:
each entry in each of the FIFO circuits comprises a way number indication relating to when the way stored within the entry was last accessed via at least one of a read or a write operation.
9. The memory system of claim 1 further comprising:
an arbitration circuit, the arbitration circuit selecting a lowest available victim portion number in a set for any writes when one or more cache portions are not valid.
10. A method for performing a least recently used section replacement operation comprising:
determining a victim portion of a memory array comprising a plurality of portions and a plurality of sections, the portions corresponding to ways within the memory array and sections corresponding to sets within the memory array via a least recently used (LRU) control circuit, the LRU circuit comprising a plurality of first in first out (FIFO) circuits, each of the plurality of FIFO circuits storing indications of a respective portion of the plurality of portions in an order based upon whether a the respective portion of the plurality of portions was most recently accessed; and,
performing a collapse function via at least one of the plurality of FIFO circuits based upon the indications of a respective portion of the plurality of portions in the order based upon whether the respective portion of the plurality of portions was most recently accessed, the collapse function allowing the each of the plurality of FIFO circuits to provide a true LRU function to the LRU circuit such that a victim portion is always a last recently used portion.
11. The method of claim 10 further comprising:
performing a push function via the FIFO circuit when an invalid portion is written; and,
performing a push and collapse function via the FIFO circuit simultaneously and together when a valid portion is read or written.
12. The method of claim 10 further comprising:
performing at least one of a pop function and a collapse function via the FIFO circuit when a section is invalidated.
13. The method of claim 10 wherein:
each entry in the FIFO comprises a portion number indication relating to when the portion stored within the entry was last accessed.
14. The method of claim 13 wherein:
each portion of the cache comprises a valid bit, the valid bit indicating that a portion of the cache comprises valid data, the valid bit being set when the portion is written and cleared upon being invalidated.
15. The method of claim 10 wherein:
the memory array comprises an m-set, n-way set associative cache;
the memory controller comprises m LRU circuits corresponding to each set of the memory array.
16. The method of claim 15 wherein:
each of the m LRU circuits comprise a respective first in first out (FIFO) circuit, each FIFO circuit being of n-depth, each FIFO circuit storing at least some of the plurality of ways in an order based upon whether a way of the plurality of ways was most recently accessed.
17. The method of claim 16 wherein:
each entry in each of the FIFO circuits comprises a way number indication relating to when the way stored within the entry was last accessed via at least one of a read or a write operation.
18. The method of claim 10 further comprising:
selecting a lowest available victim portion number via an arbitration circuit for any writes when one or more cache ways are not valid.