LRU cache replacement for a partitioned set associative cache
US7856633B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 24, 2000 |
| Grant date | Dec 21, 2010 |
| Priority date | — |
| Expiry date | Mar 24, 2020 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F12/121
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method of partitioning a memory resource, associated with a multi-threaded processor, includes defining the memory resource to include first and second portions that are dedicated to the first and second threads respectively. A third portion of the memory resource is then designated as being shared between the first and second threads. Upon receipt of an information item, (e.g., a microinstruction associated with the first thread and to be stored in the memory resource), a history of Least Recently Used (LRU) portions is examined to identify a location in either the first or the third portion, but not the second portion, as being a least recently used portion. The second portion is excluded from this examination on account of being dedicated to the second thread. The information item is then stored within a location, within either the first or the third portion, identified as having been least recently used.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.