Dynamic Log Area Allocation for Storage Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data storage systems in computer systems are inefficient in managing log entries for logical paths, as they often allocate a large number of unused log entries, leading to wastage of resources, especially in environments where only a small number of logical paths are actively used.
Innovation Solution
The system dynamically allocates log entries by dividing the log area into areas for corresponding logical paths and generates new areas by reducing existing ones when necessary, allowing for flexible allocation based on usage conditions, thereby optimizing the use of resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a fixed large number of log entries are allocated for each logical path, then reliability is improved by ensuring sufficient log capacity, but resource waste increases when logical paths are not actively used
Solution Approach 1:
The patent implements dynamic allocation of log entry areas where the storage capacity for each logical path is not fixed but adjusts based on actual usage. The system monitors whether logical paths are actively used and dynamically allocates or releases log entry areas accordingly, transforming the static allocation model into a dynamic one that adapts to changing usage patterns.
Solution Approach 2:
The patent applies local quality by allowing different logical paths to have different log entry capacities based on their specific needs and usage patterns. Instead of uniform allocation, each logical path receives appropriate storage resources according to its actual requirements, with actively used paths receiving more capacity and inactive paths having reduced or zero allocation.
2Adaptability or versatility
If log area is divided into multiple areas for different logical paths, then adaptability is improved by enabling flexible allocation, but device complexity increases due to area management overhead
Solution Approach 1:
The patent segments the total log area into multiple independent sub-areas, each dedicated to a specific logical path. This segmentation allows the system to manage storage resources in discrete units that can be independently allocated and released. Each logical path has its own designated area within the log structure, enabling fine-grained control over storage allocation.
Solution Approach 2:
The patent implements a self-service mechanism where the system automatically manages the allocation and release of log entry areas based on usage detection. When a logical path becomes inactive, the system automatically releases its log entry area without requiring manual intervention, and when it becomes active again, the area is automatically reallocated. This automation reduces the operational complexity of managing multiple areas.
3Productivity
If log entries are reallocated based on usage conditions, then productivity is improved by optimizing storage utilization, but loss of time increases due to dynamic allocation operations
Solution Approach 1:
The patent employs preliminary action by pre-establishing the framework for dynamic allocation and setting up monitoring mechanisms that detect usage conditions. The system is prepared in advance with the capability to reallocate areas, and usage patterns are continuously monitored so that allocation decisions can be made based on pre-collected information about logical path activity, reducing the time needed for reallocation operations.
Data Source
AI summary
A computer-implemented method for storing data in a storage area, includes: storing a first data unit in a first area of the storage area, in response to a request to store a first data unit having a first attribute in the storage area, when at least one data unit having the first attribute is stored in the first area; and generating, a second area by reducing the first area, when no data unit having the second attribute is stored in the storage area in response to a request to store a second data unit having a second attribute in the storage area; furthermore, storing the second data unit in the second area.