Dynamic Shared Journal for Data Protection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data protection systems face challenges in dynamically adjusting journal size and optimizing retention times for multiple users, leading to inefficient allocation of journal space and prolonged data protection process initiation times.
Innovation Solution
Implementing a system where multiple consistency groups use a single thin VMDK with a dynamic quota for journal blocks, allowing for fast allocation and re-allocation of space based on user needs, and optimizing retention times through proportional, equal, or priority-based allocation methods.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a fixed journal size is allocated to each consistency group, then the journal space is reserved in advance, but the allocation time is significant and space cannot be efficiently shared among multiple users
Solution Approach 1:
The patent implements dynamic journal space allocation where the journal size for each consistency group is not fixed but can be adjusted in real-time based on actual usage needs. The system monitors journal consumption and automatically expands or contracts journal space dynamically, eliminating the need for time-consuming pre-allocation while ensuring space availability when needed.
Solution Approach 2:
The patent merges multiple consistency groups' journal requirements into a single shared journal volume. Instead of allocating separate fixed journals to each consistency group, the system combines them into one shared resource that all consistency groups can access, improving space utilization and eliminating redundant allocations while maintaining data protection integrity.
2Adaptability or versatility
If large journal volumes are allocated to meet multiple users' needs, then sufficient space is available for all users, but the total allocation time becomes significant
Solution Approach 1:
The system implements dynamic journal space allocation where the journal size for each consistency group is not fixed but can be adjusted in real-time based on actual usage needs. The system monitors journal consumption and automatically expands or contracts journal space dynamically, eliminating the need for time-consuming pre-allocation while ensuring space availability when needed.
Solution Approach 2:
The journal allocation system operates autonomously by monitoring each consistency group's usage patterns and automatically allocating or releasing space as needed. The system self-regulates the journal volume without requiring manual intervention or pre-planning, thereby reducing allocation time while maintaining adaptability to varying user demands.
3Ease of operation
If users specify retention time instead of journal size, then configuration is simplified, but the system cannot optimize journal space usage for multiple users
Solution Approach 1:
The system automatically calculates and adjusts journal size based on the retention time parameter provided by users. By monitoring data write rates, compression ratios, and retention requirements, the system self-determines the optimal journal size without user intervention, simplifying configuration while maximizing space utilization efficiency through automated optimization algorithms.
Solution Approach 2:
The system implements continuous monitoring of journal usage patterns, write rates, and retention requirements to dynamically adjust journal allocation. This feedback mechanism allows the system to optimize journal space usage in real-time based on actual performance data while maintaining simple user-facing configuration through retention time specifications.
Data Source
AI summary
A system is provided that includes one or more hardware processors, and a non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations including: gathering information concerning thin journal space usage, in a thin journal, by each of a plurality of consistency groups, and the thin journal space comprises a plurality of journal blocks; computing an ideal journal block state for each consistency group; computing an achievable journal block state for each consistency group; and computing a transition step from the achievable journal block state to the ideal journal block state.