Selecting partial task resources in a dispersed storage network
First Claim
Patent Images
1. A method for execution by a processing system of a dispersed storage and task (DST) processing unit that includes a processor, the method comprises:
- storing data as one or more first sets of encoded data slices in a plurality of dispersed storage and task execution (DSTE) units, the one or more first sets of encoded data slices encoded utilizing a first information dispersal algorithm having a first decode threshold number, wherein the data is also stored as one or more second sets of encoded data slices in a subset of the plurality of DSTE units, the one or more second sets of encoded data slices encoded utilizing a second information dispersal algorithm having a second decode threshold number;
identifying, via the processing system, a selected DSTE unit of the subset of DSTE units to perform one or more partial tasks of a task to be performed on at least one encoded data slice of the one or more second sets of encoded data slices;
issuing, via the processing system, the one or more partial tasks to the selected DSTE unit;
receiving, via the processing system, one or more partial results from the selected DSTE unit, wherein the selected DSTE unit performs the one or more partial tasks on the at least one encoded data slice to produce the one or more partial results; and
outputting, via the processing system, a result based on the received one or more partial task results;
wherein the each of the one or more first sets of encoded data slices includes a first information dispersal algorithm (IDA) width number of encoded data slices, and wherein the first decode threshold number of each of the one or more first sets of encoded data slices is required to recover the data using the first IDA, and wherein the first decode threshold number is greater than half of the first IDA width number.
3 Assignments
0 Petitions
Accused Products
Abstract
A method for use in a dispersed storage network operates to identify a selected DSTE unit of a subset of DSTE units to perform one or more partial tasks of a task to be performed on at least one encoded data slice; issue the one or more partial tasks to the selected DSTE unit; receive one or more partial results from the selected DSTE unit, wherein the selected DSTE unit performs the one or more partial tasks on the at least one encoded data slice to produce the one or more partial results; and output a result based on the received one or more partial task.
-
Citations
18 Claims
-
1. A method for execution by a processing system of a dispersed storage and task (DST) processing unit that includes a processor, the method comprises:
-
storing data as one or more first sets of encoded data slices in a plurality of dispersed storage and task execution (DSTE) units, the one or more first sets of encoded data slices encoded utilizing a first information dispersal algorithm having a first decode threshold number, wherein the data is also stored as one or more second sets of encoded data slices in a subset of the plurality of DSTE units, the one or more second sets of encoded data slices encoded utilizing a second information dispersal algorithm having a second decode threshold number; identifying, via the processing system, a selected DSTE unit of the subset of DSTE units to perform one or more partial tasks of a task to be performed on at least one encoded data slice of the one or more second sets of encoded data slices; issuing, via the processing system, the one or more partial tasks to the selected DSTE unit; receiving, via the processing system, one or more partial results from the selected DSTE unit, wherein the selected DSTE unit performs the one or more partial tasks on the at least one encoded data slice to produce the one or more partial results; and outputting, via the processing system, a result based on the received one or more partial task results; wherein the each of the one or more first sets of encoded data slices includes a first information dispersal algorithm (IDA) width number of encoded data slices, and wherein the first decode threshold number of each of the one or more first sets of encoded data slices is required to recover the data using the first IDA, and wherein the first decode threshold number is greater than half of the first IDA width number. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A processing system of a first dispersed storage and task (DST) processing unit comprises:
-
at least one processor; memory that stores operational instructions, that when executed by the at least one processor cause the processing system to; store data as one or more first sets of encoded data slices in a plurality of dispersed storage and task execution (DSTE) units, the one or more first sets of encoded data slices encoded utilizing a first information dispersal algorithm having a first decode threshold number, wherein the data is also stored as one or more second sets of encoded data slices in a subset of the plurality of DSTE units, the one or more second sets of encoded data slices encoded utilizing a second information dispersal algorithm having a second decode threshold number; identify a selected DSTE unit of the subset of DSTE units to perform one or more partial tasks of a task to be performed on at least one encoded data slice of the one or more second sets of encoded data slices; issue the one or more partial tasks to the selected DSTE unit; receive one or more partial results from the selected DSTE unit, wherein the selected DSTE unit performs the one or more partial tasks on the at least one encoded data slice to produce the one or more partial results; and output a result based on the received one or more partial task results; wherein the each of the one or more first sets of encoded data slices includes a first information dispersal algorithm (IDA) width number of encoded data slices, and wherein the first decode threshold number of each of the one or more first sets of encoded data slices is required to recover the data using the first IDA, and wherein the first decode threshold number is greater than half of the first IDA width number. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A non-transitory computer readable storage medium comprises:
-
at least one memory section that stores operational instructions that, when executed by a processing system of a dispersed storage network (DSN) that includes a processor and a memory, causes the processing system to; store data as one or more first sets of encoded data slices in a plurality of dispersed storage and task execution (DSTE) units, the one or more first sets of encoded data slices encoded utilizing a first information dispersal algorithm having a first decode threshold number, wherein the data is also stored as one or more second sets of encoded data slices in a subset of the plurality of DSTE units, the one or more second sets of encoded data slices encoded utilizing a second information dispersal algorithm having a second decode threshold number; identify a selected DSTE unit of the subset of DSTE units to perform one or more partial tasks of a task to be performed on at least one encoded data slice of the one or more second sets of encoded data slices; issue the one or more partial tasks to the selected DSTE unit; receive one or more partial results from the selected DSTE unit, wherein the selected DSTE unit performs the one or more partial tasks on the at least one encoded data slice to produce the one or more partial results; and output a result based on the received one or more partial task results; wherein the each of the one or more first sets of encoded data slices includes a first information dispersal algorithm (IDA) width number of encoded data slices, and wherein the first decode threshold number of each of the one or more first sets of encoded data slices is required to recover the data using the first IDA, and wherein the first decode threshold number is greater than half of the first IDA width number. - View Dependent Claims (14, 15, 16, 17, 18)
-
Specification