Block Storage Change Map Integrity via Copy Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for maintaining a change map in block level storage devices are application-specific and do not scale efficiently, making them ineffective and inefficient in certain situations, particularly affecting system administrators' ability to perform administrative tasks like backups and data replication without impacting system performance.
Innovation Solution
A block level change tracking engine intercepts change messages from applications, maintains multiple copies of the change map with counter values, headers, and footers to ensure data integrity and usability, and allows for partial change maps when memory is insufficient, enabling efficient recovery and updating even after system crashes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple copies of the change map are maintained, then reliability is improved, but device complexity increases
Solution Approach 1:
The patent implements multiple copies of the change map (first copy and second copy) stored in different locations within the block storage device. This copying approach ensures that if one copy becomes corrupted or unavailable, another copy can be used, thereby improving reliability without requiring complex external redundancy systems
Solution Approach 2:
The change map is divided into multiple segments or copies that can be independently managed and accessed. Each copy can be independently validated using counter values and checksums, allowing the system to segment the reliability function across multiple independent data structures rather than relying on a single complex integrity system
2Measurement precision
If counter values and checksums are used to validate copies, then measurement precision is improved, but use of energy increases
Solution Approach 1:
Counter values and checksums are pre-calculated and stored alongside each change map copy during the normal update process. This preliminary action allows for rapid validation without requiring complex real-time computation, as the validation data is already prepared and can be quickly compared against current state to detect corruption
Solution Approach 2:
Counter values and checksums act as intermediary validation markers that simplify the verification process. Instead of performing complex integrity checks on the entire change map data, the system uses these lightweight intermediary values to quickly determine copy validity, reducing the computational energy required for validation
3Adaptability or versatility
If a partial change map is used when memory is insufficient, then adaptability is improved, but loss of information occurs
Solution Approach 1:
The system implements partial change maps that track only a subset of changed blocks when full tracking would exceed available memory. This partial action approach allows the system to adapt to memory constraints while still providing useful change tracking information, accepting that not all changes may be tracked but ensuring that tracked changes are accurately recorded
Solution Approach 2:
The change tracking system dynamically adjusts between full and partial change map modes based on available memory resources. When memory is sufficient, complete change tracking is enabled; when memory is constrained, the system transitions to partial tracking, allowing the information completeness to dynamically adapt to system conditions rather than being fixed
Data Source
AI summary
Maintaining a change map of a block storage device includes intercepting a change message from an application. The change message is intercepted by a change tracking engine. The change message requests a change to a logical block of the block storage device. The change is recorded in a first copy of the change map. The change is recorded the change in a second copy of the change map.