Aggregated Background Processing for Data Storage Resource Optimization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Previous data storage systems face inefficiencies due to unnecessary background data operations and repeated data accesses, leading to wastage of operational resources, as individual background processes perform data services independently without considering the status of data blocks or future access needs.

Innovation Solution

The proposed solution aggregates background processing by identifying blocks that have not undergone data operations like deduplication, compression, or encryption, and prevents these operations on blocks scheduled for deletion, optimizing resource usage by performing operations only when necessary and sharing data accesses across processes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If individual background processes perform data services independently, then data services such as deduplication, compression, and encryption can be performed, but unnecessary operations are performed on data blocks that will be deleted, wasting operational resources

Engineering Contradiction:
Improvedata service completionVSAvoidoperational resource consumption
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The patent merges multiple independent background processes into a unified background processing framework that coordinates deduplication, compression, encryption, and deletion operations. This allows the system to check deletion status before performing data services and avoid unnecessary operations on blocks scheduled for deletion, reducing wasted operational resources while ensuring data services are completed when needed

Inventive Principle:
Principle #5Merging (Combining)

2Reliability

If background data operations are performed independently from background free space operations, then data services can be performed on data blocks, but data blocks are accessed repeatedly by different background operations, consuming significant operational resources

Engineering Contradiction:
Improvedata service executionVSAvoidsystem performance
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent combines background data operations (deduplication, compression, encryption) with background free space operations into a single coordinated process. When a data block is selected for free space operations, the system checks whether data services have already been performed and skips redundant operations, thereby reducing repeated data accesses and improving overall system performance

Inventive Principle:
Principle #5Merging (Combining)

3Reliability

If background processing is performed on all data blocks, then data services are ensured to be performed, but operations are performed unnecessarily on blocks that will no longer be accessed

Engineering Contradiction:
Improvedata service coverageVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent performs preliminary checks on data blocks to determine their deletion status before executing background data services. By checking whether a block is scheduled for deletion in advance, the system可以避免 performing unnecessary deduplication, compression, or encryption operations on blocks that will be deleted soon, thereby reducing processing time waste while ensuring services are performed on blocks that will be retained

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS9959049B1Aggregated background processing in a data storage system to improve system resource utilization
Publication Date: 2018.05.01 EMC IP HLDG CO LLC
  • US9959049B1 patent drawing
  • US9959049B1 patent drawing
  • US9959049B1 patent drawing

AI summary

Techniques for aggregating background processing in a data storage system. Blocks are identified having contents on which a data operation was not performed in-line. The background data operation is prevented for blocks that will no longer be accessed by the host computer because they are only mapped to files implementing data objects that are scheduled for future deletion. A region of blocks may be selected that meets a criteria for performing a background free space operation, and the background data operation may be performed on the contents of blocks in the selected region while the contents of those blocks are being relocated to other blocks while performing the background free space operation. While performing the background data operation, blocks may be freed from files that implement data objects scheduled for future deletion.