Page-Based Compressed Storage Management for Memory Capacity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The performance of computer processors is hindered by bottlenecks such as slow data transfer from hard disk drives to random access memory (RAM), and increasing RAM usage is cost-prohibitive due to high costs.
Innovation Solution
Implementing page-based compressed storage management, where memory pages with similar priority levels are compressed into a region, allowing the memory manager to repurpose the compressed pages, thereby increasing storage capacity without the need for extensive RAM.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If more data is stored in RAM to reduce data transfer bottlenecks, then computer performance is improved, but cost increases due to high RAM prices
Solution Approach 1:
The patent implements nested compression by storing compressed versions of memory pages within the same memory hierarchy, allowing multiple levels of compression. High-priority pages are compressed into regions allocated for low-priority pages, creating a nested structure where compressed data resides within the memory space of less important data, effectively increasing usable RAM capacity without additional hardware cost
Solution Approach 2:
The patent changes the compression parameter dynamically based on page priority levels. Different compression algorithms and compression ratios are applied to different priority levels of memory pages, allowing the system to optimize between storage capacity and access speed by adjusting compression parameters according to the importance of the data
2Quantity of substance
If memory pages are compressed into a region, then storage capacity is increased, but memory access time may increase due to decompression requirements
Solution Approach 1:
The patent applies local quality by differentiating treatment based on page priority. High-priority pages are either kept uncompressed or use faster decompression algorithms, while low-priority pages use higher compression ratios. This localized approach ensures that frequently accessed important data experiences minimal access time penalty while less important data provides the compression benefit
Solution Approach 2:
The patent performs preliminary compression of memory pages before they are needed, allowing the compressed data to be pre-positioned in designated regions. When pages are accessed, the decompression can begin immediately upon detection of the access pattern, reducing the effective access time by overlapping compression/decompression preparation with other system operations
3Adaptability or versatility
If the memory manager is allowed to repurpose compressed pages, then memory utilization is improved, but complexity increases due to management overhead
Solution Approach 1:
The patent segments the memory management system into distinct components: a compression manager that handles the compression and allocation of compressed page regions, and a memory manager that handles traditional memory allocation. The compression manager maintains a separate data structure that tracks which compressed pages correspond to which original pages, allowing the memory manager to operate with simplified logic while the compression manager handles the complex mapping and repurposing decisions
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A memory is made up of multiple pages, and different pages can have different priority levels. A set of memory pages having at least similar priority levels are identified and compressed into an additional set of memory pages having at least similar priority levels. The additional set of memory pages are classified as being the same type of page as the set of memory pages that was compressed (e.g., as memory pages that can be repurposed). Thus, a particular set of memory pages can be compressed into a different set of memory pages of the same type and corresponding to at least similar priority levels. However, due to the compression, the quantity of memory pages into which the set of memory pages is compressed is reduced, thus increasing the amount of data that can be stored in the memory.