Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A method for backing up data, the method comprising: identifying a volume of data to back up to a target; determining a number of backup tasks that can execute in parallel to back up the data to the target, wherein determining the number of backup tasks comprises adjusting the number of backup tasks in accordance with a fragmentation level of the target; dividing the volume into a number of sections corresponding to the number of backup tasks, wherein each section is associated with a particular backup task; and initiating the backup tasks to back up their corresponding sections in parallel.
This invention relates to data backup systems, specifically optimizing parallel backup operations to improve efficiency and performance. The problem addressed is the inefficiency in traditional backup methods where data is backed up sequentially or with a fixed number of parallel tasks, which can lead to suboptimal performance, especially when dealing with fragmented storage targets. The method involves identifying a volume of data to be backed up to a target storage location. It then determines the optimal number of backup tasks that can run simultaneously to back up the data, adjusting this number based on the fragmentation level of the target storage. A highly fragmented target may require fewer parallel tasks to avoid performance degradation, while a less fragmented target can handle more parallel tasks for faster backup completion. The data volume is divided into sections corresponding to the determined number of backup tasks, with each section assigned to a specific task. The backup tasks then execute in parallel, each handling its assigned section, ensuring efficient and balanced utilization of system resources. This approach dynamically optimizes backup performance by adapting to storage conditions, reducing backup time and improving reliability.
2. The method of claim 1 , wherein each backup task generates a data set storing backup data from its corresponding section.
A system and method for distributed data backup involves dividing a data storage system into multiple sections, each assigned to a separate backup task. Each backup task generates a data set containing backup data from its corresponding section. The backup tasks operate independently, allowing parallel processing to improve efficiency. The system ensures that backup operations are distributed across the storage system, reducing the risk of bottlenecks and improving reliability. The data sets generated by each backup task are stored separately, enabling selective recovery of specific sections if needed. This approach enhances scalability and fault tolerance by isolating backup operations, ensuring that failures in one section do not affect others. The method supports large-scale data storage environments by distributing the workload and optimizing resource utilization. The system may also include mechanisms for monitoring and managing the backup tasks to ensure consistent performance and data integrity. This distributed backup approach is particularly useful in high-availability systems where continuous data protection is critical.
3. The method of claim 2 , wherein each data set contains control information linking the data sets together.
This invention relates to data processing systems that manage multiple data sets, particularly in environments where data integrity and synchronization are critical. The problem addressed is ensuring that related data sets remain properly linked and synchronized, preventing errors or inconsistencies when data is accessed or modified. The invention describes a method for managing data sets where each data set includes control information that establishes and maintains connections between the data sets. This control information enables the system to track relationships, dependencies, or hierarchical structures among the data sets. For example, if one data set is updated, the control information ensures that dependent data sets are also updated or validated accordingly. The control information may include metadata, pointers, or identifiers that explicitly define how the data sets interact. The method ensures that when data is processed, retrieved, or modified, the system can automatically verify and enforce the relationships between the data sets. This prevents orphaned data, inconsistencies, or errors that could arise from unlinked or improperly synchronized data. The approach is particularly useful in databases, distributed systems, or applications where data integrity is essential, such as financial systems, medical records, or enterprise resource planning (ERP) software. By embedding control information within each data set, the system provides a self-contained mechanism for maintaining data relationships without relying on external coordination. This improves reliability, reduces the risk of data corruption, and simplifies system maintenance.
4. The method of claim 1 , wherein each backup task generates a member of a Partitioned Data Set Extended (PDSE) data set.
A method for managing backup tasks in a computing environment involves generating a member of a Partitioned Data Set Extended (PDSE) data set for each backup task. PDSE is a type of data set in mainframe systems that allows multiple logical partitions (members) to be stored within a single physical data set, improving storage efficiency and organization. The method addresses the challenge of efficiently storing and retrieving backup data by leveraging PDSE's structured partitioning capabilities. Each backup task, which may involve copying, archiving, or securing data from a source system, is assigned a dedicated member within the PDSE. This ensures that backup data is logically separated while being physically consolidated, reducing storage overhead and simplifying management. The method may also include steps for initializing the PDSE, defining member attributes, and handling data integrity checks to ensure reliable backup operations. By using PDSE members for individual backup tasks, the system enhances scalability and performance, as each member can be independently accessed or processed without affecting others. This approach is particularly useful in environments requiring high availability and efficient data recovery.
5. The method of claim 1 , wherein determining a number of backup tasks comprises adjusting the number of backup tasks in accordance with an amount of memory available.
A system and method for optimizing backup task allocation in a computing environment addresses the challenge of efficiently managing backup operations in systems with limited memory resources. The invention dynamically adjusts the number of concurrent backup tasks based on available memory to prevent system overload while ensuring data protection. The method involves monitoring memory availability and scaling the number of active backup tasks proportionally to the available memory. If memory is scarce, fewer backup tasks are executed to avoid performance degradation, while excess memory allows for more parallel backups to improve efficiency. The system may also prioritize critical data for backup when memory is constrained. This approach ensures reliable data backup without compromising system stability, particularly in environments with fluctuating memory conditions. The invention is applicable to cloud storage, enterprise servers, and distributed computing systems where resource management is critical. By dynamically adjusting backup task allocation, the system maintains optimal performance and data integrity under varying memory conditions.
6. The method of claim 1 , wherein a higher level of fragmentation of the target results in a higher number of backup tasks.
A system and method for managing data backup tasks in a distributed storage environment addresses the challenge of efficiently distributing and executing backup operations across multiple storage nodes. The invention focuses on optimizing backup performance by dynamically adjusting the number of backup tasks based on the fragmentation level of the target data. When the target data exhibits a higher degree of fragmentation, the system automatically generates a greater number of backup tasks to parallelize the backup process, thereby improving throughput and reducing completion time. The method involves analyzing the fragmentation characteristics of the target data, determining an optimal task distribution strategy, and allocating backup tasks to available storage nodes accordingly. This approach ensures that fragmented data, which typically requires more complex handling, is processed efficiently without overloading any single node. The system may also incorporate load balancing mechanisms to further enhance performance and reliability. By dynamically scaling the number of backup tasks in response to data fragmentation, the invention provides a more adaptive and efficient backup solution compared to static or fixed-task approaches.
7. The method of claim 1 , wherein determining a number of backup tasks further comprises adjusting the number of backup tasks in accordance with a number of tape mounts that are available.
A system and method for optimizing backup operations in a data storage environment, particularly where backup tasks are managed using tape storage media. The invention addresses the inefficiency of traditional backup systems that do not dynamically adjust the number of concurrent backup tasks based on available tape mounts, leading to underutilized storage resources or excessive wear on tape drives. The method involves determining the number of backup tasks to execute by analyzing the available tape mounts, which are the physical or logical connections to tape drives. By adjusting the number of backup tasks in proportion to the available tape mounts, the system ensures efficient resource utilization, reduces backup completion time, and minimizes mechanical wear on tape drives. The method may also consider other factors such as tape drive performance, data volume, and priority levels to further optimize the backup process. This dynamic adjustment prevents bottlenecks and ensures that backup operations are completed in a timely manner while maintaining system reliability. The invention is particularly useful in large-scale data centers or enterprise environments where multiple tape drives and backup tasks must be managed efficiently.
8. A computer program product for backing up data, the computer program product comprising a non-transitory computer-readable storage medium having computer-usable program code embodied therein, the computer-usable program code configured to perform the following when executed by at least one processor: identify a volume of data to back up to a target; determine a number of backup tasks that can execute in parallel to back up the data to the target, wherein determining the number of backup tasks comprises adjusting the number of backup tasks in accordance with a fragmentation level of the target; divide the volume into a number of sections corresponding to the number of backup tasks, wherein each section is associated with a particular backup task; and initiate the backup tasks to back up their corresponding sections in parallel.
This invention relates to data backup systems, specifically optimizing parallel backup operations to improve efficiency and performance. The problem addressed is inefficient data backup processes that do not adapt to storage conditions, leading to suboptimal performance and resource utilization. The solution involves a computer program that dynamically adjusts the number of parallel backup tasks based on the fragmentation level of the target storage device. Higher fragmentation may reduce the number of parallel tasks to avoid performance degradation, while lower fragmentation allows more tasks to run simultaneously for faster backups. The program divides the data volume into sections, each assigned to a separate backup task, and executes these tasks in parallel. This approach ensures that backup operations are optimized for the specific conditions of the target storage, balancing speed and resource usage. The system dynamically adapts to storage conditions, improving backup efficiency and reliability.
9. The computer program product of claim 8 , wherein each backup task generates a data set storing backup data from its corresponding section.
A system and method for distributed backup management in a computing environment involves dividing a data storage system into multiple sections, each assigned to a distinct backup task. Each backup task operates independently to generate a data set containing backup data from its assigned section. The system ensures that backup operations are distributed across the storage system, improving efficiency and reducing the risk of data loss. The backup tasks may run concurrently or sequentially, depending on system requirements. The data sets generated by each task are stored separately, allowing for selective restoration of specific sections without reconstructing the entire backup. This approach enhances scalability and fault tolerance by isolating backup operations, ensuring that failures in one section do not compromise the integrity of others. The system may also include mechanisms for monitoring task progress, managing resource allocation, and verifying data consistency. The distributed nature of the backup process optimizes performance by leveraging parallel processing and minimizing contention for shared resources. This method is particularly useful in large-scale storage environments where centralized backup solutions may be inefficient or unreliable.
10. The computer program product of claim 9 , wherein each data set contains control information linking the data sets together.
A system and method for managing and linking multiple data sets in a computer program product. The technology addresses the challenge of organizing and correlating disparate data sets in digital environments, ensuring efficient retrieval and processing. The invention involves a computer program product that stores and processes data sets, where each data set includes control information that establishes connections between the data sets. This control information enables the system to dynamically link and reference related data sets, improving data integrity and accessibility. The linked data sets can be used for various applications, such as data analysis, reporting, or automated decision-making, where maintaining relationships between different data elements is critical. The control information may include metadata, identifiers, or pointers that define the relationships and dependencies between the data sets, allowing the system to navigate and retrieve linked data efficiently. This approach enhances data management by ensuring that related data remains interconnected, reducing errors and improving the accuracy of data-driven processes. The system may also support real-time updates and synchronization of linked data sets, ensuring consistency across the entire data structure.
11. The computer program product of claim 8 , wherein each backup task generates a member of a Partitioned Data Set Extended (PDSE) data set.
This invention relates to data backup systems, specifically improving the efficiency and organization of backup tasks in mainframe environments. The problem addressed is the need for a structured and scalable approach to storing backup data, particularly in systems using Partitioned Data Set Extended (PDSE) data sets, which are commonly used in IBM z/OS environments for storing multiple related files or data objects in a single, logically partitioned structure. The invention describes a computer program product that enhances backup operations by generating a separate member within a PDSE data set for each backup task. This approach ensures that each backup is stored as an independent, logically isolated unit within the PDSE, allowing for efficient retrieval, management, and versioning of backup data. The system automates the creation of these members, ensuring that each backup task is assigned a unique identifier and stored in a structured manner, reducing the risk of data corruption or loss. Additionally, the invention may include features for tracking backup metadata, such as timestamps, task identifiers, and recovery points, to facilitate quick access and recovery of specific backups. By organizing backups in this way, the invention improves data integrity, simplifies backup management, and enhances recovery processes in mainframe environments. The use of PDSE members ensures compatibility with existing mainframe storage systems while providing a scalable solution for handling large volumes of backup data. This approach is particularly useful in enterprise environments where reliable and efficient backup and recovery are critical.
12. The computer program product of claim 8 , wherein determining a number of backup tasks comprises adjusting the number of backup tasks in accordance with an amount of memory available.
A system and method for optimizing backup task allocation in a computing environment. The invention addresses the challenge of efficiently managing backup operations in systems with limited memory resources, ensuring reliable data protection without overloading system capacity. The system dynamically adjusts the number of concurrent backup tasks based on available memory, preventing resource exhaustion while maintaining backup performance. This involves monitoring memory availability and scaling the number of active backup tasks proportionally, either increasing tasks when memory is abundant or reducing them when memory is constrained. The adjustment may also consider other system parameters, such as CPU load or network bandwidth, to further refine task allocation. By dynamically balancing backup workloads with available resources, the system ensures consistent data protection without degrading overall system performance. The invention is particularly useful in environments where memory availability fluctuates, such as cloud-based or virtualized systems, where static backup configurations may lead to inefficiencies or failures. The solution enhances reliability and efficiency in data backup processes by adapting to real-time system conditions.
13. The computer program product of claim 8 , wherein a higher level of fragmentation of the target results in a higher number of backup tasks.
This invention relates to data backup systems, specifically addressing the challenge of efficiently managing backup tasks in environments with fragmented data storage. The system dynamically adjusts the number of backup tasks based on the level of fragmentation in the target storage. Fragmentation occurs when data is scattered across multiple storage locations, increasing the complexity and time required for backup operations. The invention monitors the fragmentation level of the target storage and automatically scales the number of backup tasks accordingly. A higher fragmentation level triggers the creation of more backup tasks to ensure timely and reliable data protection. Each backup task operates independently, allowing parallel processing to mitigate the performance impact of fragmentation. The system also includes mechanisms to optimize task distribution, prioritize critical data, and dynamically allocate resources to maintain backup efficiency. This approach reduces backup time, minimizes system overhead, and ensures data integrity even in highly fragmented storage environments. The solution is particularly useful in large-scale storage systems where fragmentation is common due to frequent data modifications or deletions.
14. The computer program product of claim 8 , wherein determining a number of backup tasks further comprises adjusting the number of backup tasks in accordance with a number of tape mounts that are available.
A system for managing backup tasks in a data storage environment, particularly where tape-based storage is used, addresses the challenge of efficiently allocating backup operations to available resources. The system dynamically adjusts the number of backup tasks based on the availability of tape mounts, ensuring optimal utilization of storage media while minimizing idle time or overloading. The method involves monitoring the current state of tape drives and available media, then recalculating the number of concurrent backup tasks to match the available tape mounts. This adjustment prevents bottlenecks by avoiding excessive task scheduling when tape resources are limited and maximizes throughput when resources are abundant. The system may also incorporate additional factors, such as task priority or data size, to further refine task allocation. By dynamically balancing backup tasks with available tape mounts, the system improves storage efficiency and reduces operational delays in large-scale backup environments.
15. A system for backing up data, the system comprising: at least one processor; at least one memory device operably coupled to the at least one processor and storing instructions for execution on the at least one processor, the instructions causing the at least one processor to: identify a volume of data to back up to a target; determine a number of backup tasks that can execute in parallel to back up the data to the target, wherein determining the number of backup tasks comprises adjusting the number of backup tasks in accordance with a fragmentation level of the target; divide the volume into a number of sections corresponding to the number of backup tasks, wherein each section is associated with a particular backup task; and initiate the backup tasks to back up their corresponding sections in parallel.
The system is designed for efficient data backup by optimizing parallel processing based on target storage conditions. In data backup operations, performance can degrade due to storage fragmentation, which slows down write operations. This system addresses the problem by dynamically adjusting the number of parallel backup tasks to match the fragmentation level of the target storage device. The system first identifies the data volume to be backed up and evaluates the target storage's fragmentation. Based on this assessment, it calculates the optimal number of parallel backup tasks to maximize throughput while avoiding resource contention. The data volume is then divided into sections, each assigned to a separate backup task. These tasks execute concurrently, writing their respective sections to the target in parallel. By dynamically adapting the parallelism to storage conditions, the system improves backup speed and efficiency, particularly in fragmented storage environments. The approach ensures balanced workload distribution and minimizes bottlenecks during the backup process.
16. The system of claim 15 , wherein each backup task generates a data set storing backup data from its corresponding section.
A system for managing backup operations in a distributed storage environment addresses the challenge of efficiently backing up large-scale data across multiple storage sections. The system divides a storage system into multiple sections, each assigned a dedicated backup task. Each backup task operates independently to generate a data set containing backup data from its corresponding section. This modular approach ensures parallel processing, reducing backup time and improving system reliability. The system further includes a backup controller that coordinates the backup tasks, ensuring synchronization and consistency across all sections. The backup controller monitors the status of each backup task, detects failures, and initiates recovery procedures as needed. The system also supports incremental backups, where only changed data is backed up, optimizing storage usage and network bandwidth. Additionally, the system provides data compression and encryption features to enhance security and reduce storage requirements. The backup tasks can be scheduled dynamically based on system load and priority, allowing for flexible and efficient backup management. This system is particularly useful in large-scale data centers and cloud storage environments where high availability and data integrity are critical.
17. The system of claim 15 , wherein each backup task generates a member of a Partitioned Data Set Extended (PDSE) data set.
A system for managing backup tasks in a computing environment, particularly in systems utilizing Partitioned Data Set Extended (PDSE) data sets. The system addresses the challenge of efficiently organizing and retrieving backup data by leveraging PDSE structures, which allow for segmented storage and improved data management. Each backup task within the system generates a distinct member of a PDSE data set, enabling logical separation of backup data while maintaining a unified storage structure. This approach enhances data integrity, simplifies retrieval, and optimizes storage utilization. The system may include components for initiating backup tasks, processing data, and storing results in PDSE members, ensuring that each backup operation is isolated yet accessible within the same data set. The use of PDSE members allows for efficient indexing, versioning, and recovery of backup data, addressing common issues in traditional backup systems where data fragmentation or retrieval inefficiencies occur. The system may also incorporate mechanisms for tracking backup tasks, verifying data consistency, and managing access to PDSE members, ensuring reliable and scalable backup operations.
18. The system of claim 15 , wherein determining a number of backup tasks comprises adjusting the number of backup tasks in accordance with an amount of memory available.
A system for managing backup tasks in a computing environment adjusts the number of concurrent backup operations based on available memory resources. The system monitors memory availability and dynamically scales the number of active backup tasks to prevent system overload. When memory is abundant, the system increases the number of concurrent backups to improve efficiency. Conversely, when memory is limited, the system reduces the number of active backups to avoid performance degradation. This adaptive approach ensures optimal resource utilization while maintaining system stability. The system may also prioritize certain backup tasks over others based on predefined criteria, such as data criticality or user-defined policies. Additionally, the system may implement scheduling algorithms to distribute backup tasks evenly across available resources, further enhancing performance. By dynamically adjusting the number of backup tasks in response to memory availability, the system ensures reliable and efficient data protection without compromising system performance.
19. The system of claim 15 , wherein a higher level of fragmentation of the target results in a higher number of backup tasks.
The invention relates to a data backup system designed to optimize the fragmentation of target data during backup operations. The system addresses the challenge of efficiently managing backup tasks when dealing with fragmented data, which can lead to increased complexity and resource consumption. The system dynamically adjusts the number of backup tasks based on the level of fragmentation in the target data. Specifically, as the fragmentation of the target data increases, the system automatically generates a higher number of backup tasks to ensure efficient and reliable data backup. This approach helps balance the workload across multiple tasks, reducing the risk of bottlenecks and improving overall backup performance. The system may also include mechanisms to monitor fragmentation levels, distribute tasks across available resources, and prioritize critical data segments to enhance backup efficiency. By dynamically scaling the number of backup tasks in response to fragmentation, the system ensures that backup operations remain efficient and scalable, even in environments with highly fragmented data structures.
20. The system of claim 15 , wherein determining a number of backup tasks further comprises adjusting the number of backup tasks in accordance with a number of tape mounts that are available.
The system relates to data backup management, specifically optimizing the allocation of backup tasks to available tape mounts. In data storage environments, efficient backup operations are critical to ensure data integrity and minimize downtime. A common challenge is dynamically adjusting backup workloads to match the available resources, such as tape drives, to prevent bottlenecks or underutilization. The system determines the number of backup tasks to be executed based on the number of tape mounts available. Tape mounts refer to the physical or logical connections between tape drives and storage media. By dynamically adjusting the number of backup tasks in accordance with available tape mounts, the system ensures that backup operations are distributed efficiently. This prevents overloading any single tape drive while maximizing the utilization of all available resources. The adjustment may involve increasing or decreasing the number of concurrent backup tasks based on real-time or predicted availability of tape mounts. This approach improves backup performance, reduces completion time, and enhances reliability by avoiding resource contention. The system may also incorporate additional factors, such as tape drive capacity, data priority, or historical performance metrics, to further optimize task allocation.
Unknown
September 1, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.