بعض محتويات هذا التطبيق غير متوفرة في الوقت الحالي.
إذا استمرت هذه الحالة ، يرجى الاتصال بنا علىتعليق وإتصال
1. (WO2017039795) SYSTEMS AND METHODS FOR VERIFICATION OF CODE RESILIENCY FOR DATA STORAGE
ملاحظة: نص مبني على عمليات التَعرف الضوئي على الحروف. الرجاء إستخدام صيغ PDF لقيمتها القانونية

CLAIMS

What is claimed is:

1. A method implemented by processor-based logic of a storage system storing source objects as a plurality of erasure coded fragments, the method comprising: determining, by the logic of the storage system, a set of erasure coded fragments commonly available for one or more source objects stored by the storage system;

partitioning, by the logic of the storage system, the set of erasure coded fragments commonly available for one or more source objects into a number of (g) groups of fragments;

obtaining, by the logic of the storage system, a prospective number of losses (L) of groups of fragments for verifying source data integrity with respect to the storage system; and

analyzing, by the logic of the storage system, a plurality of combinations of loss of the prospective number of groups of fragments from the g groups of fragments, whereby it is determined whether the storage system is susceptible to source data loss due to a loss of L of the g groups of fragments.

2. The method of claim 1 , wherein fragments from the set of erasure coded fragments commonly available for one or more source objects that reside within the same rack in the storage system are within the same group within the g groups of fragments.

3. The method of claim 1, wherein the analyzing the plurality of

combinations of loss of the prospective number of groups of fragments comprises:

analyzing a plurality of sets (5) of the groups of erasure coded fragments.

4. The method of claim 3, wherein each set (5) of the plurality of sets comprises g - L groups of coded fragments.

5. The method of claim 1, wherein a size of each group g is at least s, wherein if the analyzing the plurality of combinations of loss of the prospective number of groups of fragments from the g groups of fragments indicates that the storage system is not susceptible to source data loss due to a loss of L of the g groups of fragments then it is determined that up to L»s, storage nodes of the storage system may fail without source data loss.

6. The method of claim 1 , wherein the groups (g) of fragments are chosen based on a covering design with parameters g, L, and L', wherein L' > L and a size of a union of any g - L' groups is at least k + x, wherein k is a number of source fragments used by the erasure code and x is an additional number of fragments used to increase recovery reliability.

7. An apparatus for analyzing source objects stored by a storage system as a plurality of erasure coded fragments, the apparatus comprising:

one or more data processors; and

one or more non-transitory computer-readable storage media containing program code configured to cause the one or more data processors to perform operations including:

determining a set of erasure coded fragments commonly available for one or more source objects stored by the storage system;

partitioning the set of erasure coded fragments commonly available for one or more source objects into a number of (g) groups of fragments;

obtaining a prospective number of losses (L) of groups of fragments for verifying source data integrity with respect to the storage system; and

analyzing a plurality of combinations of loss of the prospective number of groups of fragments from the g groups of fragments, whereby it is determined whether the storage system is susceptible to source data loss due to a loss of L of the g groups of fragments.

8. The apparatus of claim 7, wherein fragments from the set of erasure coded fragments commonly available for one or more source objects that reside within the same rack in the storage system are within the same group within the g groups of fragments.

9. The apparatus of claim 7, wherein the analyzing the plurality of combinations of loss of the prospective number of groups of fragments comprises:

analyzing a plurality of sets (5) of the groups of erasure coded fragments.

10. The apparatus of claim 9, wherein each set (5) of the plurality of sets comprises g - L groups of coded fragments.

11. The apparatus of claim 7, wherein a size of each group g is at least s, wherein if the analyzing the plurality of combinations of loss of the prospective number of groups of fragments from the g groups of fragments indicates that the storage system is not susceptible to source data loss due to a loss of L of the g groups of fragments then it is determined that up to L»s, storage nodes of the storage system may fail without source data loss.

12. The apparatus of claim 7, wherein the groups (g) of fragments are chosen based on a covering design with parameters g, L, and L', wherein L' > L and a size of a union of any g - L' groups is at least k + x, wherein k is a number of source fragments used by the erasure code and x is an additional number of fragments used to increase recovery reliability.

13. An apparatus for analyzing source objects stored by a storage system as a plurality of erasure coded fragments, the apparatus comprising:

means for determining a set of erasure coded fragments commonly available for one or more source objects stored by the storage system;

means for partitioning the set of erasure coded fragments commonly available for one or more source objects into a number of (g) groups of fragments;

means for obtaining a prospective number of losses (L) of groups of fragments for verifying source data integrity with respect to the storage system; and

means for analyzing a plurality of combinations of loss of the prospective number of groups of fragments from the g groups of fragments, whereby it is determined whether the storage system is susceptible to source data loss due to a loss of L of the g groups of fragments.

14. The apparatus of claim 13, wherein fragments from the set of erasure coded fragments commonly available for one or more source objects that reside within the same rack in the storage system are within the same group within the g groups of fragments.

15. The apparatus of claim 13, wherein the means for analyzing the plurality of combinations of loss of the prospective number of groups of fragments comprises: means for analyzing a plurality of sets (5) of the groups of erasure coded fragments.

16. The apparatus of claim 15, wherein each set (5) of the plurality of sets comprises g - L groups of coded fragments.

17. The apparatus of claim 13, wherein a size of each group g is at least s, wherein if the analyzing the plurality of combinations of loss of the prospective number of groups of fragments from the g groups of fragments indicates that the storage system is not susceptible to source data loss due to a loss of L of the g groups of fragments then it is determined that up to L»s, storage nodes of the storage system may fail without source data loss.

18. The apparatus of claim 13, wherein the groups (g) of fragments are chosen based on a covering design with parameters g, L, and L', wherein L' > L and a size of a union of any g - L' groups is at least k + x, wherein k is a number of source fragments used by the erasure code and x is an additional number of fragments used to increase recovery reliability.

19. A non-transitory computer-readable medium comprising codes for analyzing source objects stored by a storage system as a plurality of erasure coded fragments, the codes causing the computer to:

determine a set of erasure coded fragments commonly available for one or more source objects stored by the storage system;

partition the set of erasure coded fragments commonly available for one or more source objects into a number of (g) groups of fragments;

obtain a prospective number of losses (L) of groups of fragments for verifying source data integrity with respect to the storage system; and

analyze a plurality of combinations of loss of the prospective number of groups of fragments from the g groups of fragments, whereby it is determined whether the storage system is susceptible to source data loss due to a loss of L of the g groups of fragments.

20. The non-transitory computer-readable medium of claim 19, wherein fragments from the set of erasure coded fragments commonly available for one or more source objects that reside within the same rack in the storage system are within the same group within the g groups of fragments.

21. The non- transitory computer-readable medium of claim 19, wherein the codes causing the computer to analyze the plurality of combinations of loss of the prospective number of groups of fragments further cause the computer to:

analyze a plurality of sets (5) of the groups of erasure coded fragments.

22. The non-transitory computer-readable medium of claim 21, wherein each set (5) of the plurality of sets comprises g - L groups of coded fragments.

23. The non- transitory computer-readable medium of claim 19, wherein a size of each group g is at least s, wherein if analyzing the plurality of combinations of loss of the prospective number of groups of fragments from the g groups of fragments indicates that the storage system is not susceptible to source data loss due to a loss of L of the g groups of fragments then it is determined that up to L»s, storage nodes of the storage system may fail without source data loss.

24. The non-transitory computer-readable medium of claim 19, wherein the groups (g) of fragments are chosen based on a covering design with parameters g, L, and L', wherein L' > L and a size of a union of any g - L' groups is at least k + x, wherein k is a number of source fragments used by the erasure code and x is an additional number of fragments used to increase recovery reliability.