IP Library Granted Patent US 11,922,015
Granted Patent B2
US 11,922,015 · App. 18/045,694 · Granted Mar 5, 2024

Generating recovered data in a storage network

Inventors: Bruno H. Cabral (Chicago, IL); Wesley B. Leggette (Chicago, IL)
Assignee: Pure Storage, Inc.
G06F3/0604G06F3/0619G06F3/0644G06F3/0659G06F3/0661G06F3/067G06F11/1076G06F11/1092G06F21/62G06F21/64H03M7/6011H04L1/00H04L1/0045H04L1/0057H04L1/0076H04L9/085H04L9/0894H04L63/10H04L63/101H04L63/102H04L67/06H04L67/10H04L67/1097H04L67/565G06F2211/1028G06F2212/254H03M13/1515H03M13/616H04L63/12H04L2209/30H04L2209/34H04L2209/608
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,922,015
App. No.
18/045,694
Granted
Mar 5, 2024
Kind
B2
Abstract

A storage network operates by: issuing a read threshold number of read slice requests to storage units of a set of storage units, where the read threshold number of read slice requests identifies a read threshold number of encoded slices of a set of encoded slices corresponding to a data segment; when one or more other encoded data slices of the read threshold number of encoded slices is not received within a time threshold, facilitating receiving a decode threshold number of encoded slices of the set of encoded slices; decoding the decode threshold number of encoded slices to produce recovered encoded data slices, wherein a number of the recovered encoded data slices corresponds to the read threshold number minus a number of the encoded slices received within the time threshold; and outputting the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold.

Claims (35)

1. A method comprises:

issuing a read threshold number of read slice requests to storage units of a set of storage units, where the read threshold number of read slice requests identifies a read threshold number of encoded slices of a set of encoded slices corresponding to a data segment;

when one or more other encoded data slices of the read threshold number of encoded slices is not received within a time threshold, facilitating receiving a decode threshold number of encoded slices of the set of encoded slices;

decoding the decode threshold number of encoded slices to produce recovered encoded data slices, wherein a number of the recovered encoded data slices corresponds to the read threshold number minus a number of the encoded slices received within the time threshold; and

outputting the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold.

2. The method of claim 1 , wherein the data segment was dispersed storage error encoded to produce the set of encoded slices.

3. The method of claim 1 , wherein the set of encoded slices for the corresponding data segment includes a first subset of encoded data slices and includes a second subset of encoded code slices, wherein the first subset and the second subset are mutually exclusive and collectively exhaustive with respect to the set of encoded slices, wherein the encoded data slices received within response timeframe are elements of the first subset and wherein at least one of the recovered encoded data slices is an element of the second subset.

4. The method of claim 3 , wherein a size of the first subset corresponds the decode threshold number.

5. The method of claim 3 , further comprising determining a subset of the set of encoded slices received within the time threshold;

determining a number of necessary remaining slices based on subtracting a size of the subset from the decode threshold number; and

generating a set of additional requests for transmission to the storage units of the set of storage units, wherein a number of additional requests of the set is equal to the number of necessary remaining slices, and wherein the set of additional requests indicate encoded code slices of the second subset.

6. The method of claim 5 , wherein no additional requests are transmitted to the storage units of the set of storage units in response to number of necessary remaining slices being determined to be equal to zero.

7. The method of claim 3 , wherein the read threshold number of read slice requests is determined by selecting an entirety of the first subset to be included in the read threshold number of read slice requests.

8. The method of claim 1 , wherein outputting of the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold is in accordance with a data slice ordering, and wherein the data slice ordering is based on consecutive data of the corresponding data segment.

9. The method of claim 8 , wherein the read threshold number of read slice requests to storage units are transmitted consecutively at a corresponding plurality of different times in an order corresponding to the data slice ordering.

10. The method of claim 8 , wherein a requesting entity reproduces the data segment in accordance with the data slice ordering.

11. A processing system comprises:

at least one processor; and

a memory that stores operational instructions, that when executed by the at least one processor, cause the processing system to perform operations that include:

issuing a read threshold number of read slice requests to storage units of a set of storage units, where the read threshold number of read slice requests identifies a read threshold number of encoded slices of a set of encoded slices corresponding to a data segment;

when one or more other encoded data slices of the read threshold number of encoded slices is not received within a time threshold, facilitating receiving a decode threshold number of encoded slices of the set of encoded slices;

decoding the decode threshold number of encoded slices to produce recovered encoded data slices, wherein a number of the recovered encoded data slices corresponds to the read threshold number minus a number of the encoded slices received within the time threshold; and

outputting the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold.

12. The processing system of claim 11 , wherein the data segment was dispersed storage error encoded to produce the set of encoded slices.

13. The processing system of claim 11 , wherein the set of encoded slices for the corresponding data segment includes a first subset of encoded data slices and includes a second subset of encoded code slices, wherein the first subset and the second subset are mutually exclusive and collectively exhaustive with respect to the set of encoded slices, wherein the encoded data slices received within response timeframe are elements of the first subset and wherein at least one of the recovered encoded data slices is an element of the second subset.

14. The processing system of claim 13 , wherein a size of the first subset corresponds the decode threshold number.

15. The processing system of claim 13 , wherein the operations further include:

determining a subset of the set of encoded slices received within the time threshold;

determining a number of necessary remaining slices based on subtracting a size of the subset from the decode threshold number; and

generating a set of additional requests for transmission to the storage units of the set of storage units, wherein a number of additional requests of the set is equal to the number of necessary remaining slices, and wherein the set of additional requests indicate encoded code slices of the second subset.

16. The processing system of claim 15 , wherein no additional requests are transmitted to the storage units of the set of storage units in response to number of necessary remaining slices being determined to be equal to zero.

17. The processing system of claim 13 , wherein the read threshold number of read slice requests is determined by selecting an entirety of the first subset to be included in the read threshold number of read slice requests.

18. The processing system of claim 11 , wherein outputting of the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold is in accordance with a data slice ordering, and wherein the data slice ordering is based on consecutive data of the corresponding data segment.

19. The processing system of claim 18 , wherein the read threshold number of read slice requests to storage units are transmitted consecutively at a corresponding plurality of different times in an order corresponding to the data slice ordering.

20. The processing system of claim 18 , wherein a requesting entity reproduces the data segment in accordance with the data slice ordering.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 13, 2022
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 061665/0287 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 12, 2022
From: CABRAL, BRUNO H.; LEGGETTE, WESLEY B.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 061386/0086 →
Continuity (8)
Continuation 17446841 · Sep 3, 2021
Continuation 16850193 · Apr 16, 2020
Continuation 16165608 · Oct 19, 2018
Continuation In Part 15841759 · Dec 14, 2017
Continuation In Part 15450470 · Mar 6, 2017
Continuation 14589639 · Jan 5, 2015
Provisional Application 61944722 · Feb 26, 2014
Related Publication 20230056072A1 · Feb 23, 2023