Cache storage management using dual stacks
US6336167B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 8, 1999 |
| Grant date | Jan 1, 2002 |
| Priority date | — |
| Expiry date | Oct 8, 2019 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F12/123
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Cache management in a computer system is achieved by using a cache with dual stacks with storage locations for labels associated with data units stored either in the stack or in a separate cache memory unit. The first or preliminary stack is always refreshed following each label request using a conventional Least Recently Used (LRU) algorithm. If the requested label exists in either stack, the conventional LRU algorithm is also used to update the second stack. If the requested label does not exist in either stack and the bottom position in the second stack is empty, the label is written into the top position of the second stack and existing stack entries are pushed down one position. If the bottom position in the second stack is not empty, stack entries at and below a predetermined insertion point (which may be set statically or dynamically) are pushed down, the entry in the bottom position in the stack is discarded and the label is written into the predetermined insertion point in the second stack.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.