Data Slice Relocation for Storage Space Utilization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional data storage solutions do not support the relocation of slices within a logical unit to other slices in a specified address range, resulting in lower usage rates of storage space.
Innovation Solution
A method and device for processing data that allows relocating slices by determining a second group of slices in a logical unit with a size equal to or greater than the first group, enabling data movement within or between logical units to optimize storage usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If data is stored in thin logical units with initial allocation, then storage space is allocated efficiently, but storage space utilization rate decreases when capacity is not fully used
Solution Approach 1:
The system dynamically adjusts storage allocation by moving data between slices in different logical units. When a thin logical unit has unused capacity, data is relocated from other logical units to fill the available space, making the storage system adaptive rather than static.
Solution Approach 2:
The storage system automatically performs data relocation between slices without external intervention. The system monitors storage usage and autonomously moves data to optimize utilization, eliminating the need for manual storage management.
2Device complexity
If slices are fixed in logical units, then data structure is simple, but storage space cannot be reused efficiently
Solution Approach 1:
The system divides storage into slices that can be independently managed and relocated. Each slice can be moved between logical units, allowing flexible reconfiguration while maintaining the underlying segmented structure for efficient management.
Solution Approach 2:
The system adds a new dimension to slice management by enabling movement across logical unit boundaries. Instead of confining slices to their original logical units, the system allows dimensional transitions between different logical unit spaces to optimize utilization.
3Ease of operation
If data relocation is not supported, then system operation is simple, but storage usage rate is low
Solution Approach 1:
The system introduces a storage management intermediary that handles data relocation between slices. This intermediary layer abstracts the complexity of data movement, presenting a simple interface to users while performing sophisticated relocation operations in the background.
4Stability of the object's composition
If slices cannot be moved between logical units, then system structure is stable, but storage optimization is limited
Solution Approach 1:
The system implements dynamic slice relocation that maintains structural stability through controlled transitions. Data moves between slices according to defined rules and protocols, ensuring system stability while enabling optimization when needed.
Data Source
AI summary
Techniques for processing data involve: receiving a request for moving data from a first slice group in a first logical unit to a second logical unit; determining, based on the request, a second slice group from the second logical unit, the size of the second slice group being larger than or equal to the size of the first slice group; and moving data in the first slice group into the second slice group. Such techniques enable moving data into slices in a specified address range in a specified logical unit, moving data into appropriate slices in a target logical unit when data cannot be moved to slices in a specific address range because an address range is not specified or a specified address range is unavailable can be achieved, and moving disk extents (DEs) by a Redundant Array of Multi-Core Disks (MCR) and redistributing IOs between disk extents.