Composite Data Block Compression for Cache Flush Efficiency

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing information handling systems face inefficiencies in data compression due to processing overhead and limited compression ratios when handling small data blocks, leading to discarded compression results if the ratio does not meet certain thresholds.

Innovation Solution

The system groups multiple blocks of data into a composite block, which is then compressed, allowing for higher compression ratios and improved storage efficiency by utilizing a processor to compile and compress data blocks within a cache, and storing metadata for each block.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of substance

If multiple blocks of data are grouped into a composite block for compression, then compression ratio is improved, but device complexity increases

Engineering Contradiction:

Improvecompression ratioVSAvoiddevice complexity

Core Design Contradiction:

Loss of substanceVSDevice complexity

Solution Approach 1:

The patent merges multiple fixed-size data blocks into a single composite block for compression processing. The processor groups N individual data blocks (where N≥2) into one composite block, then applies compression algorithms to the combined data, achieving higher compression ratios by exploiting redundancies across block boundaries that would be missed when compressing blocks independently.

Inventive Principle:

Principle #5Merging (Combining)

Solution Approach 2:

The patent segments the composite block into individual block portions after compression, maintaining the ability to retrieve and manage original data blocks independently. The metadata structure divides compression information into block-level entries while maintaining an overall composite block structure, enabling both compressed storage and selective access to individual blocks.

Inventive Principle:

Principle #1Segmentation

2Productivity

If compression is applied to small data blocks, then processing overhead increases, but compression ratio decreases

Engineering Contradiction:

Improveprocessing overheadVSAvoidcompression ratio

Core Design Contradiction:

ProductivityVSLoss of substance

Solution Approach 1:

By combining multiple small data blocks into a larger composite block before compression, the patent increases the amount of data available for the compression algorithm to work with, thereby improving compression ratios. This approach reduces processing overhead per unit of compressed data by spreading the fixed compression overhead across more data, making compression more efficient for small block sizes.

Inventive Principle:

Principle #5Merging (Combining)

3Loss of substance

If compression results are discarded when ratio does not meet threshold, then storage efficiency is maintained, but data loss increases

Engineering Contradiction:

Improvestorage efficiencyVSAvoiddata loss

Core Design Contradiction:

Loss of substanceVSLoss of information

Solution Approach 1:

The patent combines multiple data blocks into a composite block for compression, which increases the likelihood of achieving acceptable compression ratios by exploiting cross-block redundancies. This reduces the number of compression results that would be discarded due to poor ratios, thereby reducing data loss while maintaining storage efficiency.

Inventive Principle:

Principle #5Merging (Combining)

Data Source

PatentUS11507292B2System and method to utilize a composite block of data during compression of data blocks of fixed size

Publication Date: 2022.11.22 DELL PROD LP

AI summary

An information handling system includes a processor that detects a cache flush request of a memory device within the processor, and identifies multiple blocks of data within an address space associated with the cache flush request. The processor groups the multiple blocks of data into a single composite block of data, and compresses the composite block of data. The processor stores the compressed composite block of data, and stores metadata for the compressed composite block of data. The metadata includes information for both the composite block of data and information for each of the multiple blocks of data.