Method and apparatus for randomized cache entry replacement
An entry and cache technology, applied in memory systems, data exchange networks, memory address/allocation/relocation, etc., can solve problems such as the impossibility of knowing future requests
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0019] The following description is intended to provide a detailed description of examples of the present invention and should not be construed as limiting the present invention itself. Rather, any number of variations are intended to fall within the scope of the invention as defined by the appended claims.
[0020] Introduction
[0021] Systems and methods according to embodiments of the present invention provide a randomized hardware solution for cache entry replacement. These systems and methods employ a potential replacement list that stores cache pointer values for cache entries that are likely to be replaced, invalidates recently accessed entries, maintains information about the age of each entry in the potential replacement list, and uses random cache pointer values to replace invalidated entries. Thereby, these systems and methods are able to provide a least recently used cache pointer value that can be used to replace an entry in an associated cache. The architec...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 