Table Remap Circuit for On-The-Fly Memory Resizing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing memory allocation and deallocation techniques in computer systems face challenges in dynamically resizing memory tables without disrupting ongoing processes, particularly in Last-In-First-Out (LIFO) and Hash memories, as they often require stalling execution or causing performance degradation.
Innovation Solution
Implementing a Table Remap Circuit (TRC) that divides memory tables into interim tables and iteratively transfers elements between them, allowing seamless resizing while maintaining continuous user access through selection criteria and concurrent management of LIFO and Hash tables.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If memory tables are resized using traditional allocation and deallocation techniques, then memory can be dynamically managed, but execution must be stalled or performance degrades
Solution Approach 1:
The memory table is divided into multiple segments or regions that can be independently managed. During resizing operations, different segments can be allocated or deallocated separately, allowing the system to maintain access to other segments while the resizing occurs, thus avoiding complete execution stalls
Solution Approach 2:
The system performs preliminary allocation of memory regions in advance, preparing multiple candidate regions before they are needed. This allows resizing operations to simply switch between pre-prepared regions rather than performing complex reallocation during execution, maintaining performance
2Ease of operation
If LIFO queueing networks are used for memory management, then simple allocation/deallocation is achieved, but stability is compromised under renewal processes
Solution Approach 1:
The patent introduces an intermediary mechanism (the circuit with hash table and multiple memory regions) that mediates between the simple LIFO allocation interface and the complex stability requirements. The intermediary handles the complexity of stability management internally while maintaining simple LIFO semantics for users
Solution Approach 2:
The system dynamically changes parameters such as the selection of active memory regions and hash table configurations based on system state. This allows the memory management system to adapt to different workload conditions and maintain stability while preserving LIFO semantics
3Speed
If Hash tables are used for memory addressing, then direct access is enabled, but resizing requires complete table reconstruction
Solution Approach 1:
The hash table is segmented into multiple regions that can be independently resized. When resizing is needed, only the affected regions are reconstructed while other regions remain intact and accessible, reducing overall complexity and allowing incremental updates
Solution Approach 2:
Multiple hash table regions are pre-configured with different capacities. When resizing is required, the system can switch to a pre-configured region of appropriate size rather than reconstructing the entire table, maintaining access speed while simplifying the resizing operation
Data Source
AI summary
A computing system includes a memory and a table remap circuit. The table remap circuit is to modify a size of a table comprising table elements stored in the memory, while the table is available for access by one or more users, by (i) defining a first interim table and a second interim table, (ii) iteratively transferring table elements from the first interim table to the second interim table, (iii) in response to a request from a user to write a table element in the table, writing the table element in the first interim table or in the second interim table in accordance with a selection criterion, and (iv) remapping the table to the second interim table.