Sectored least-recently-used cache replacement
US6823427B1 · kind B1 · utility
33Cited by
11References
37Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | May 16, 2001 |
| Grant date | Nov 23, 2004 |
| Priority date | — |
| Expiry date | May 16, 2021 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F12/123
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Various methods and systems for implementing a sectored least recently used (LRU) cache replacement algorithm are disclosed. Each set in an N-way set-associative cache is partitioned into several sectors that each include two or more of the N ways. Usage status indicators such as pointers show the relative usage status of the sectors in an associated set. For example, an LRU pointer may point to the LRU sector, an MRU pointer may point to the MRU sector, and so on. When a replacement is performed, a way within the LRU sector identified by the LRU pointer is filled.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.