Cache replacement method and system
OwnerSeyed Mohideen Basheer Ahamedinventor
Life of this patent
Estimating the term…
Abstract
An implementation is a method for cache replacement may include storing a previous access bit and a current access bit for each upper level of a binary tree representing cache blocks, accessing, by a processor, a data segment in memory, selecting, by a cache controller in response to a cache miss for the data segment, a cache block for replacement using the binary tree by traversing the binary tree using the previous access bit at a first upper level, and using the current access bit at a lowest level to determine the cache block for replacement.
Claims20
A method for cache replacement, comprising:
- storing a previous access bit and a current access bit for each upper level of a binary tree representing cache blocks;
- accessing, by a processor, a data segment in memory;
- and
- selecting, by a cache controller in response to a cache miss for the data segment, a cache block for replacement using the binary tree by traversing the binary tree using the previous access bit at a first upper level, and using the current access bit at a lowest level to determine the cache block for replacement.
A system for cache replacement, comprising:
- one or more processors;
- a cache memory coupled to the one or more processors;
- and
- a cache controller configured to:
- maintain a binary tree representing cache blocks, wherein each non-leaf node of the binary tree includes a previous access bit and a current access bit;
- access a data segment in memory;
- and
- select, in response to a cache miss for the data segment, a cache block for replacement using the binary tree by traversing the binary tree using the previous access bit at each non-leaf node and the current access bit at a leaf node.
A non-transitory computer-readable storage medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform a cache replacement method, the method comprising:
- maintaining a binary tree representing cache blocks, wherein each non-leaf node of the binary tree includes a previous access bit and a current access bit;
- receiving a request to access a data segment;
- and
- selecting, in response to a cache miss for the data segment, a cache block for replacement using the binary tree by traversing the binary tree using the previous access bit at each non-leaf node and the current access bit at a leaf node.
Dependencies are inferred from the claim text.