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 comprising: storing, in a storage system comprising a plurality of sets of storage devices, a first stripe of data in a first set of the plurality of sets of storage devices, wherein the first stripe of data includes both user data and parity data; storing, in the storage system, a second stripe of data in a second set of the plurality of sets of storage devices, wherein the second stripe of data includes both user data and parity data; generating, in dependence upon at least the first stripe of data and the second stripe of data, cross-stripe parity data; and storing, in the storage system, the cross-stripe parity data in a third set of the plurality of sets of storage devices, wherein the third set of storage devices excludes the first set of storage devices and the second set of storage devices.
This invention relates to data storage systems, specifically a method for enhancing data redundancy and fault tolerance in distributed storage environments. The method addresses the problem of data loss or corruption in storage systems by implementing a multi-layered parity scheme across multiple sets of storage devices. The system includes a storage architecture with multiple sets of storage devices. A first stripe of data, containing both user data and parity data, is stored in a first set of storage devices. Similarly, a second stripe of data, also containing user data and parity data, is stored in a second set of storage devices. To further protect against data loss, cross-stripe parity data is generated based on at least the first and second stripes of data. This cross-stripe parity data is then stored in a third set of storage devices, which is distinct from the first and second sets. This approach ensures that if one or more storage devices fail, the data can be reconstructed using the parity information from the remaining devices. The method improves fault tolerance by distributing parity data across different sets of storage devices, reducing the risk of data loss due to correlated failures. The cross-stripe parity provides an additional layer of redundancy, allowing for recovery even if an entire set of storage devices becomes unavailable. This technique is particularly useful in large-scale storage systems where reliability is critical.
2. The method of claim 1 wherein the first stripe of data is stored in a first partition, the second stripe of data is stored in a second partition, and the cross-stripe parity data is stored in a third partition.
This invention relates to data storage systems, specifically methods for distributing data and parity information across multiple partitions to enhance reliability and performance. The problem addressed is ensuring data integrity and availability in storage systems, particularly when hardware failures occur. The solution involves storing data in a striped format across multiple partitions, with parity information distributed separately to allow for error detection and correction. The method involves dividing data into at least two stripes, where each stripe consists of a portion of the data. A first stripe of data is stored in a first partition, while a second stripe of data is stored in a second partition. Cross-stripe parity data, which is generated based on the first and second stripes, is stored in a third partition. This distribution ensures that if one partition fails, the remaining partitions can be used to reconstruct the lost data using the parity information. The partitions may be located on different storage devices or within different sections of a single storage device to further enhance fault tolerance. The method may also include additional stripes and corresponding parity data stored in additional partitions, depending on the desired level of redundancy. This approach improves data reliability by allowing recovery from single or multiple partition failures while maintaining efficient data access.
3. The method of claim 1 wherein the first stripe of data is stored in a first storage array, the second stripe of data is stored in a second storage array, and the cross-stripe parity data is stored in a third storage array.
This invention relates to distributed storage systems, specifically a method for storing data across multiple storage arrays with enhanced redundancy. The problem addressed is ensuring data integrity and availability in distributed storage environments where failures in individual storage arrays can lead to data loss. The solution involves distributing data and parity information across separate storage arrays to improve fault tolerance. The method involves storing a first stripe of data in a first storage array and a second stripe of data in a second storage array. Cross-stripe parity data, which provides redundancy for both stripes, is stored in a third storage array. This distribution ensures that if one storage array fails, the remaining arrays can be used to reconstruct the lost data using the parity information. The parity data is calculated across multiple stripes, allowing for recovery even if multiple arrays fail, provided the failures do not exceed the redundancy capacity. This approach improves reliability in distributed storage systems by isolating data and parity across independent storage arrays, reducing the risk of correlated failures. The method is particularly useful in large-scale storage deployments where high availability is critical.
4. The method of claim 1 wherein the first stripe of data includes a first number of data blocks and the second stripe of data includes a different number of data blocks.
A method for managing data storage in a distributed system addresses the challenge of efficiently distributing data across multiple storage nodes while optimizing performance and reliability. The method involves organizing data into stripes, where each stripe consists of multiple data blocks distributed across different storage nodes. The key innovation is that the first stripe of data includes a first number of data blocks, while the second stripe includes a different number of data blocks. This allows for flexible data distribution, enabling the system to adapt to varying storage capacities, performance requirements, or fault tolerance needs. By varying the number of data blocks per stripe, the method can balance load across nodes, improve data access efficiency, and enhance redundancy. The system may also include mechanisms to determine the optimal number of data blocks for each stripe based on factors such as node availability, network latency, or data access patterns. This approach ensures that data is distributed in a way that maximizes storage utilization and minimizes the risk of data loss or performance bottlenecks. The method is particularly useful in large-scale storage systems where dynamic adjustments are necessary to maintain efficiency and reliability.
5. The method of claim 1 wherein the first stripe of data adheres to a first RAID level and the second stripe of data adheres to a second RAID level.
This invention relates to data storage systems, specifically methods for distributing data across multiple storage devices using different RAID (Redundant Array of Independent Disks) configurations. The problem addressed is the need for flexible and efficient data distribution in storage systems, where different RAID levels offer varying trade-offs between performance, redundancy, and storage capacity. The method involves storing data in stripes across multiple storage devices, where each stripe consists of segments distributed to different devices. The first stripe of data is stored according to a first RAID level, such as RAID 0, RAID 1, RAID 5, or RAID 6, which defines how data and parity information are distributed. The second stripe of data is stored according to a second RAID level, which may differ from the first. This allows the system to optimize storage based on specific requirements, such as prioritizing speed for one set of data while ensuring redundancy for another. The method may also include dynamically adjusting the RAID levels for subsequent stripes based on changing system conditions or performance needs. This approach enhances storage efficiency and adaptability in environments where different data types or workloads demand varying levels of protection and performance.
6. The method of claim 1 further comprising: storing, in the storage system, a third stripe of data, wherein the third stripe of data includes both user data and parity data; and wherein: generating cross-stripe parity data is carried out in dependence upon at least the first stripe of data, the second stripe of data, and the third stripe of data.
This invention relates to data storage systems, specifically methods for generating and storing parity data to enhance data redundancy and fault tolerance. The problem addressed is ensuring data integrity and recoverability in storage systems when multiple data stripes are involved, particularly when some stripes contain both user data and parity data. The method involves storing a third stripe of data in a storage system, where this third stripe includes both user data and parity data. The generation of cross-stripe parity data is performed based on at least the first, second, and third stripes of data. The first stripe contains user data, while the second stripe contains parity data derived from the first stripe. The cross-stripe parity data is computed using a parity algorithm that considers all three stripes, providing an additional layer of redundancy. This approach allows for the reconstruction of lost or corrupted data by leveraging the combined information from multiple stripes, improving fault tolerance in the storage system. The method ensures that even if one or more stripes are lost, the remaining stripes and the cross-stripe parity data can be used to recover the original data. This technique is particularly useful in distributed storage systems or RAID configurations where data is spread across multiple storage devices.
7. The method of claim 1 wherein the cross-stripe parity data is generated in dependence upon only the user data in the first stripe and the user data in the second stripe.
The invention relates to data storage systems, specifically methods for generating parity data to protect against data loss in storage devices. The problem addressed is ensuring data integrity in systems where data is stored in stripes across multiple storage units, such as disks or memory modules. Traditional parity generation methods may rely on redundant or unnecessary data, leading to inefficiencies or increased storage overhead. The invention improves upon this by generating cross-stripe parity data that depends solely on the user data in two specific stripes, eliminating unnecessary dependencies. The method involves selecting a first stripe and a second stripe of user data stored in a storage system. The cross-stripe parity data is then generated based exclusively on the user data within these two stripes, without incorporating additional metadata or redundant information. This approach reduces computational overhead and storage requirements while maintaining data protection. The parity data can later be used to reconstruct lost or corrupted data in either of the two stripes, ensuring reliability. The invention is particularly useful in distributed storage systems, RAID configurations, or any system where data is distributed across multiple storage units. By focusing only on the necessary user data, the method optimizes both storage efficiency and data recovery processes.
8. An apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of: storing, in a storage system comprising a plurality of sets of storage devices in a first set of the plurality of sets of storage devices, a first stripe of data, wherein the first stripe of data includes both user data and parity data; storing, in the storage system, a second stripe of data in a second set of the plurality of sets of storage devices, wherein the second stripe of data includes both user data and parity data; generating, in dependence upon at least the first stripe of data and the second stripe of data, cross-stripe parity data; and storing, in the storage system, the cross-stripe parity data in a third set of the plurality of sets of storage devices, wherein the third set of storage devices excludes the first set of storage devices and the second set of storage devices.
This invention relates to a data storage system designed to enhance data redundancy and fault tolerance. The system addresses the problem of data loss in storage arrays by implementing a multi-layered parity scheme. The apparatus includes a computer processor and memory containing program instructions that execute the following steps. First, a first stripe of data, comprising both user data and parity data, is stored in a first set of storage devices within a storage system. Similarly, a second stripe of data, also containing user data and parity data, is stored in a second set of storage devices. The system then generates cross-stripe parity data based on at least the first and second stripes. This cross-stripe parity data is stored in a third set of storage devices, distinct from the first and second sets, ensuring that the cross-stripe parity is not co-located with the original data stripes. This approach provides an additional layer of redundancy, allowing for data recovery even if an entire set of storage devices fails. The system leverages distributed parity storage to mitigate the risk of data loss, improving overall storage reliability.
9. The apparatus of claim 8 wherein the first stripe of data is stored in a first device group, the second stripe of data is stored in a second device group, and the cross-stripe parity data is stored in a third device group.
This invention relates to data storage systems, specifically a method for distributing data and parity information across multiple storage devices to enhance reliability and performance. The system addresses the problem of data loss or corruption in storage arrays by implementing a distributed parity scheme that improves fault tolerance. The apparatus includes a storage controller that organizes data into stripes, where each stripe consists of multiple data segments and associated parity information. The data is divided into at least two stripes, with each stripe stored in a separate device group. A cross-stripe parity is generated from the data segments of the stripes and stored in a third device group. This distribution ensures that if one device group fails, the data can be reconstructed using the remaining groups and the cross-stripe parity. The storage controller manages the distribution of data and parity across the device groups, ensuring that the cross-stripe parity is calculated from the combined data of the first and second stripes. This approach provides redundancy beyond traditional RAID configurations, allowing for recovery from multiple device failures. The system is particularly useful in large-scale storage environments where data integrity and availability are critical.
10. The apparatus of claim 8 wherein the first stripe of data is stored in a first storage subsystem, the second stripe of data is stored in a second storage subsystem, and the cross-stripe parity data is stored in a third storage subsystem.
This invention relates to distributed storage systems, specifically a method for storing data across multiple storage subsystems with enhanced redundancy. The problem addressed is ensuring data integrity and availability in the event of subsystem failures by distributing data and parity information across separate storage subsystems. The apparatus includes a storage controller configured to distribute data across multiple storage subsystems. Data is divided into at least two stripes, with each stripe stored in a separate storage subsystem. Additionally, cross-stripe parity data is generated and stored in a third storage subsystem. This parity data provides redundancy by allowing reconstruction of lost data if one of the storage subsystems fails. The storage controller manages the distribution and retrieval of data, ensuring that the parity data remains consistent with the stored stripes. The system is designed to handle failures by using the parity data to recover missing data from any failed subsystem, thereby maintaining data integrity and availability. This approach improves fault tolerance in distributed storage environments by isolating data and parity across independent storage subsystems.
11. The apparatus of claim 8 wherein the first stripe of data includes a first number of data blocks and the second stripe of data includes a different number of data blocks.
This invention relates to data storage systems, specifically to apparatuses for distributing data across multiple storage devices in a striped configuration. The problem addressed is the inefficiency and inflexibility of conventional striping methods, which typically distribute data in fixed-size stripes across storage devices, leading to suboptimal performance and wasted storage capacity. The apparatus includes a data distribution system that writes data to multiple storage devices in stripes, where each stripe consists of multiple data blocks. Unlike traditional systems, the apparatus allows the first stripe of data to include a first number of data blocks, while the second stripe includes a different number of data blocks. This variable striping enables dynamic allocation of storage space, improving efficiency by adapting to varying data sizes and storage device capacities. The system can adjust the number of blocks per stripe based on factors such as data type, storage device performance, or available space, ensuring optimal use of storage resources. The apparatus may also include error detection and correction mechanisms to maintain data integrity across the distributed storage devices. By allowing variable stripe sizes, the system enhances flexibility, reduces wasted space, and improves overall storage performance.
12. The apparatus of claim 8 wherein the first stripe of data adheres to a first RAID level and the second stripe of data adheres to a second RAID level.
This invention relates to data storage systems, specifically apparatuses for managing data across multiple storage devices using different RAID (Redundant Array of Independent Disks) configurations. The problem addressed is the need to efficiently distribute and protect data across storage devices by applying different RAID levels to different portions of the data, optimizing performance, redundancy, and storage efficiency. The apparatus includes a controller and multiple storage devices. The controller is configured to distribute data into at least two stripes, where each stripe is stored across a subset of the storage devices. The first stripe adheres to a first RAID level, such as RAID 0, RAID 1, RAID 5, or RAID 6, which defines how data and parity information are distributed for redundancy and performance. The second stripe adheres to a second RAID level, which may differ from the first. For example, the first stripe might use RAID 5 for balanced performance and redundancy, while the second stripe uses RAID 6 for higher fault tolerance. The controller manages the distribution, ensuring that data integrity and access performance are maintained according to the selected RAID configurations. This approach allows for flexible storage management, enabling different portions of data to be optimized for specific use cases, such as high-speed access or enhanced fault tolerance.
13. The apparatus of claim 8 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of: storing, in the storage system, a third stripe of data, wherein the third stripe of data includes both user data and parity data; and wherein: generating cross-stripe parity data is carried out in dependence upon at least the first stripe of data, the second stripe of data, and the third stripe of data.
This invention relates to data storage systems, specifically methods for generating and storing parity data to enhance data redundancy and fault tolerance. The problem addressed is ensuring data integrity and recoverability in storage systems, particularly when multiple data stripes are involved. The apparatus includes a storage system and a computer processor configured to execute program instructions. The system stores at least three stripes of data, where each stripe contains both user data and parity data. The parity data is generated based on the combined content of the first, second, and third stripes. This cross-stripe parity calculation improves redundancy by allowing data recovery even if one or more stripes are corrupted or lost. The apparatus further includes mechanisms for managing these stripes, ensuring that parity data is consistently updated and aligned with the stored user data. The cross-stripe parity generation process leverages the collective information from multiple stripes, providing a more robust error correction mechanism compared to traditional single-stripe parity schemes. This approach is particularly useful in distributed storage environments where data is spread across multiple nodes or storage devices, reducing the risk of data loss due to hardware failures or other disruptions. The system dynamically adjusts parity calculations as new data is written, maintaining consistency and reliability across the storage system.
14. The apparatus of claim 8 wherein the cross-stripe parity data is generated in dependence upon only the user data in the first stripe and the user data in the second stripe.
The invention relates to data storage systems, specifically apparatuses for generating and using cross-stripe parity data to enhance data reliability. The problem addressed is ensuring data integrity in storage systems where data is distributed across multiple storage devices, such as in RAID (Redundant Array of Independent Disks) configurations. The apparatus includes a storage system with multiple storage devices organized into stripes, where each stripe contains user data distributed across the devices. The apparatus generates cross-stripe parity data that depends solely on the user data from at least two stripes, rather than relying on parity data from other sources. This cross-stripe parity data is stored separately and can be used to reconstruct lost or corrupted data in the event of a storage device failure. The apparatus ensures that the parity data is generated efficiently and accurately, improving fault tolerance without requiring additional computational overhead. The system may also include mechanisms for distributing and managing the parity data across the storage devices to optimize performance and reliability. This approach enhances data protection by providing redundancy that spans multiple stripes, reducing the risk of data loss in case of multiple device failures.
15. A computer program product disposed upon a non-transitory computer readable medium, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of: storing a first stripe of data in a first set of a plurality of sets of storage devices in a storage system, wherein the first stripe of data includes both user data and parity data; storing a second stripe of data in a second set of the plurality of sets of storage devices, wherein the second stripe of data includes both user data and parity data; generating, in dependence upon at least the first stripe of data and the second stripe of data, cross-stripe parity data; and storing the cross-stripe parity data in a third set of the plurality of sets of storage devices, wherein the third set of storage devices excludes the first set of storage devices and the second set of storage devices.
This invention relates to a data storage system that enhances fault tolerance by implementing a multi-layered parity scheme. The system addresses the problem of data loss in storage arrays by distributing data and parity information across multiple sets of storage devices, providing redundancy beyond traditional single-stripe parity mechanisms. The system stores a first stripe of data, which includes both user data and parity data, in a first set of storage devices. Similarly, a second stripe of data, also containing user data and parity data, is stored in a second set of storage devices. To further protect against data loss, the system generates cross-stripe parity data based on at least the first and second stripes. This cross-stripe parity data is then stored in a third set of storage devices, which is distinct from the first and second sets. This approach ensures that if one or more storage devices fail, the system can reconstruct lost data using either the intra-stripe parity or the cross-stripe parity, depending on the failure scenario. The method improves data reliability by distributing redundancy across multiple layers, reducing the risk of catastrophic data loss in large-scale storage systems.
16. The computer program product of claim 15 wherein the first stripe of data is stored in a first partition, the second stripe of data is stored in a second partition, and the cross-stripe parity data is stored in a third partition.
This invention relates to data storage systems, specifically methods for distributing and protecting data across multiple storage partitions using a RAID (Redundant Array of Independent Disks) configuration. The problem addressed is ensuring data integrity and availability in storage systems by distributing data and parity information across separate partitions to prevent data loss in case of partition failure. The system involves storing data in stripes, where each stripe consists of multiple segments distributed across different partitions. A first stripe of data is stored in a first partition, a second stripe of data is stored in a second partition, and cross-stripe parity data, which provides redundancy, is stored in a third partition. The parity data is calculated across multiple stripes to enhance fault tolerance. By separating data and parity into distinct partitions, the system reduces the risk of correlated failures and improves recovery capabilities. The partitions may be located on different physical or logical storage devices, further enhancing reliability. This approach allows for efficient data reconstruction in the event of a partition failure, ensuring continuous data availability. The system is particularly useful in enterprise storage environments where high reliability and fault tolerance are critical.
17. The computer program product of claim 15 wherein the first stripe of data is stored in a first storage array, the second stripe of data is stored in a second storage array, and the cross-stripe parity data is stored in a third storage array.
This invention relates to distributed storage systems, specifically a method for storing data across multiple storage arrays with enhanced redundancy. The problem addressed is ensuring data integrity and availability in distributed storage environments where individual storage arrays may fail. The solution involves striping data across multiple storage arrays and generating cross-stripe parity data to enable recovery from failures. The system stores a first stripe of data in a first storage array and a second stripe of data in a second storage array. Cross-stripe parity data is generated based on the first and second stripes and stored in a third storage array. This parity data allows reconstruction of either stripe if one of the storage arrays fails. The parity data is computed using an error-correcting code, such as a Reed-Solomon code, to ensure data can be recovered even if multiple storage arrays fail. The system dynamically selects storage arrays for storing data and parity based on availability and performance metrics. The method also includes verifying the integrity of stored data and parity by periodically recalculating and comparing parity values. If a discrepancy is detected, the system automatically reconstructs the affected data using the remaining stripes and parity data. This approach improves fault tolerance and data durability in distributed storage systems.
18. The computer program product of claim 15 wherein the first stripe of data includes a first number of data blocks and the second stripe of data includes a different number of data blocks.
The invention relates to data storage systems, specifically methods for distributing data across multiple storage devices to improve performance and reliability. The problem addressed is the inefficiency and potential imbalance in data distribution when storing data in stripes across multiple storage devices, which can lead to uneven workloads and reduced performance. The invention involves a computer program product that manages data storage by dividing data into stripes, where each stripe is distributed across multiple storage devices. The key improvement is that the first stripe of data includes a first number of data blocks, and the second stripe of data includes a different number of data blocks. This allows for flexible and optimized data distribution, ensuring that storage devices are utilized more evenly and efficiently. By varying the number of data blocks in each stripe, the system can adapt to different storage conditions, workloads, or device capacities, preventing bottlenecks and improving overall system performance. The invention also includes mechanisms to ensure data integrity and redundancy, such as error correction and parity checks, to maintain reliability. The system dynamically adjusts the number of data blocks in subsequent stripes based on real-time performance metrics, such as device latency or available storage space, to further optimize data distribution. This approach enhances storage efficiency, reduces access times, and improves the lifespan of storage devices by balancing the workload across the system.
19. The computer program product of claim 15 wherein the first stripe of data adheres to a first RAID level and the second stripe of data adheres to a second RAID level.
This invention relates to data storage systems, specifically a method for managing data across multiple storage devices using different RAID (Redundant Array of Independent Disks) configurations. The problem addressed is the need for flexible and efficient data distribution in storage systems where different RAID levels are applied to different portions of the data. RAID levels define how data is distributed and protected across multiple disks, with each level offering different trade-offs in performance, redundancy, and storage efficiency. The invention involves a computer program product that processes data by dividing it into at least two stripes. The first stripe adheres to a first RAID level, such as RAID 0, which provides no redundancy but offers high performance by striping data across multiple disks. The second stripe adheres to a second RAID level, such as RAID 5, which provides redundancy by distributing parity information across disks, ensuring data can be recovered if a disk fails. The program product includes instructions for storing these stripes on separate storage devices, allowing different portions of the data to be managed according to their specific requirements. This approach enables optimized performance and reliability by tailoring the RAID configuration to the needs of each data portion. The system may also include error detection and correction mechanisms to ensure data integrity across the different RAID configurations.
20. The computer program product of claim 15 further comprising computer program instructions that, when executed, cause a computer to carry out the steps of: storing, in the storage system, a third stripe of data, wherein the third stripe of data includes both user data and parity data; and wherein: generating cross-stripe parity data is carried out in dependence upon at least the first stripe of data, the second stripe of data, and the third stripe of data.
This invention relates to data storage systems, specifically methods for generating and storing parity data to enhance data redundancy and fault tolerance. The system addresses the problem of data loss in storage systems by implementing a distributed parity scheme across multiple data stripes. Each stripe contains both user data and parity data, and cross-stripe parity data is generated based on at least three stripes of data. This approach improves data recovery capabilities by allowing reconstruction of lost or corrupted data from multiple sources. The system stores a third stripe of data, which includes both user data and parity data, and uses this stripe in conjunction with at least two other stripes to generate cross-stripe parity data. This method enhances fault tolerance by distributing parity information across multiple stripes, reducing the risk of data loss due to single or multiple failures. The invention is particularly useful in storage systems where high availability and data integrity are critical, such as enterprise storage solutions or distributed storage environments. The use of cross-stripe parity data ensures that data can be reconstructed even if one or more stripes are lost or corrupted, improving overall system reliability.
Unknown
October 20, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.