Compressed Redundancy Storage Protection for Low-Overhead Writes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data protection techniques in storage systems, such as RAID-5 and RAID-6, suffer from significant write overhead and performance degradation when dealing with failed storage devices, leading to potential data loss and reduced availability.
Innovation Solution
Implementing a compression-based data protection scheme where data blocks are written along with their compressed versions to protection blocks, allowing for reduced read and write operations and dual drive protection, thereby enhancing performance and availability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If parity-based data protection schemes (RAID-5, RAID-6) are used, then data protection is provided, but write operations have significant overhead and performance degradation
Solution Approach 1:
The patent changes the fundamental parameter of data protection from parity-based mathematical operations to compression-based redundancy. Instead of using XOR operations to generate parity data, the system compresses data blocks and stores multiple versions, fundamentally altering how data protection is achieved while reducing write overhead.
Solution Approach 2:
The patent creates multiple copies of compressed data blocks and stores them across different drives. Rather than relying on parity calculations, the system generates redundant copies through compression and distributes them, eliminating the need for read-modify-write operations and associated performance penalties.
2Reliability
If traditional parity schemes are used, then data protection is achieved, but the system operates in degraded mode with performance suffering when a storage device fails
Solution Approach 1:
The patent performs compression and creates redundant copies of data blocks before any failure occurs. By pre-compressing data and distributing multiple versions across drives, the system ensures that if a drive fails, the remaining copies are already in a usable state, eliminating the need for time-consuming reconstruction operations during degraded mode.
3Productivity
If compression-based protection is implemented, then write overhead is reduced and performance improves, but the system requires storing compressed versions of data blocks
Solution Approach 1:
The patent applies compression selectively to data blocks that benefit from it, rather than compressing all data uniformly. By identifying and compressing only the portions of data that achieve meaningful size reduction, the system balances storage space requirements with the performance benefits of reduced write overhead.
Data Source
AI summary
A storage system, such as a file server, receives a request to perform a write operation that affects a data block. In response, the storage system determines if the data block may be compressed to fit inside a redundancy block for protection. If the data block may be sufficiently compressed, the data block is written to the storage device and the compressed version of the data block is written to the protection block. If the data block may not be sufficiently compressed, the data block is written to the storage device and another data protection scheme, e.g. parity, is used to protect the data. A map, checksum and/or other tracking technique is used to associate stripes of data with the protection scheme used to protect data in the stripe.