Age-Tagged Memory Management for Low-Overhead Element Overwriting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing memory management systems face inefficiencies in managing limited memory resources, particularly in caching scenarios, due to the overhead of maintaining duplicate data structures like LRU, which require excessive memory accesses and searches to identify elements for overwriting.
Innovation Solution
A memory management system that assigns an age value to each element, allowing for the identification and overwriting of multiple elements based on their age, using a sequence counter to determine elements that can be overwritten, thereby reducing the need for additional data structures and memory accesses.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If LRU data structure is used to manage memory, then memory management functionality is provided, but device complexity and memory access overhead increase
Solution Approach 1:
The patent extracts the age tracking functionality from the separate LRU data structure and integrates it directly into the memory locations themselves. Each memory location stores an age value that indicates when the entry was last accessed, eliminating the need for a separate LRU list while maintaining the ability to identify least recently used entries for eviction.
Solution Approach 2:
The patent merges the LRU tracking mechanism with the primary memory storage structure. Instead of maintaining a separate data structure to track access patterns, the age values are stored within the memory locations themselves, combining the storage and tracking functions into a single unified structure.
2Ease of operation
If LRU data structure is used to identify elements for overwriting, then memory management is achieved, but memory access time and search operations increase
Solution Approach 1:
The memory locations themselves provide the information needed to identify candidates for overwriting through their stored age values. The memory structure serves its own tracking function without requiring external data structures or additional search operations, as the age information is inherently part of the stored data.
3Ease of operation
If separate LRU data structure is maintained, then element identification is possible, but additional memory requirements increase
Solution Approach 1:
The patent removes the need for a separate LRU data structure by extracting the essential tracking information and embedding it directly in the memory locations. This eliminates the dual data structure approach and reduces overall memory consumption while maintaining element identification capability.
Data Source
Figure 1
Figure 2
AI summary
The invention relates to a device for managing a memory, wherein the memory has a plurality of memory locations and wherein the memory is configured to store an element with an associated age value in each of the plurality of memory locations. The device is configured to receive a write access request to write a new element into the memory, compare the age value of an element present in the memory with a predetermined age, and, if the age value of the element present in the memory is greater than or equal to the predetermined age, overwrite the existing element with the new element.