Chained Mapping Compression for Memory Devices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing memory devices face challenges in optimizing physical space utilization due to inefficiencies in data storage and retrieval, particularly when compressing data, which can lead to complex defragmentation processes and increased mapping table sizes.
Innovation Solution
Implementing a chained mapping scheme with compression in memory devices, where a single entry in the mapping table points to the first stripe of compressed data, and subsequent stripes are stored in extra locations within the current stripe, reducing the overall mapping table size and simplifying data retrieval and storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data compression is implemented in memory devices, then physical space utilization is improved, but mapping table size increases and defragmentation complexity increases
Solution Approach 1:
The patent implements nested chaining where mapping table entries themselves contain chains of pointers to multiple stripe locations. This nested structure allows the mapping table to efficiently reference compressed data spread across multiple physical locations without requiring a completely separate large mapping structure, thus managing space utilization while controlling mapping table complexity.
Solution Approach 2:
The patent transitions from a traditional flat mapping table to a multi-dimensional chained structure where each entry can point to multiple stripe locations through chaining. This dimensional expansion in the mapping structure allows efficient representation of compressed data without linearly increasing the base mapping table size, as the chaining mechanism provides additional referencing capability.
2Quantity of substance
If data compression is implemented in memory devices, then physical space utilization is improved, but defragmentation process complexity increases
Solution Approach 1:
The patent performs preliminary actions by pre-establishing chained mapping structures during data write operations. The mapping table entries are pre-configured with chains of pointers to appropriate stripe locations before data is actually compressed and stored. This preliminary setup simplifies subsequent defragmentation operations, as the chained structure provides a ready-made framework for reorganizing compressed data without requiring complex real-time analysis and re-mapping.
3Ease of operation
If traditional mapping tables are used for compressed data, then data retrieval is straightforward, but mapping table size becomes excessively large
Solution Approach 1:
The patent extracts the essential mapping function from a monolithic mapping table and distributes it across a chained structure where only the necessary mapping information is stored in each entry. By taking out redundant mapping references and retaining only the essential chain pointers, the system maintains easy data retrieval through the chain while significantly reducing the overall mapping table footprint.
Data Source
AI summary
A variety of applications can include a memory device having chained mapping with compression of received data. The memory device can include a mapping table having an entry location to associate a virtual page with a physical address of a first stripe of compressed data of the virtual page. A controller of the memory device, responsive to the data of the virtual page being compressed data, can load information about a second stripe of the compressed data into extra locations in the first stripe different from locations for compressed data of the virtual page in the first stripe. Additional apparatus, systems, and methods are disclosed.