Resolving write conflicts in a dispersed storage network

1. A method for execution by a dispersed storage and task (DST) execution unit that includes a processor, the method comprises:

receiving a write slice request from a requesting entity, wherein the write slice request includes a plurality of encoded data slices and a corresponding plurality of slice names;

interpreting the plurality of slice names to produce a slice name range;

determining whether a write lock conflict exists based on the slice name range;

issuing an unfavorable write slice response to the requesting entity when the write lock conflict is determined to exist;

when the write lock conflict is determined to not exist:

initiating local storage of the plurality of encoded data slices;

issuing a favorable write slice response to the requesting entity; and

indicating that the slice name range is not locked when completing the local storage of the plurality of encoded data slices.

2. The method of claim 1 , wherein the plurality of encoded data slices are associated with at least one data segment, and wherein the at least one data segment was dispersed storage error encoded to produce the plurality of encoded data slices for storage in a set of storage units that includes the DST execution unit.

3. The method of claim 1 , further comprising indicating that the slice name range is locked prior to initiating local storage of the plurality of encoded data slices.

4. The method of claim 1 , wherein producing the slice name range includes identifying a lowest slice name and a high slice name of the corresponding plurality of slice names to produce the slice name range.

5. The method of claim 1 , wherein determining whether a write lock conflict exists includes retrieving at least one locked slice name range corresponding to at least one currently active write lock, and further includes comparing the slice name range to the at least one locked slice name range.

6. The method of claim 5 , wherein the at least one locked slice name range is retrieved from a locked slice name range list stored in local memory, and wherein indicating that the slice name range is not locked includes updating the locked slice name range list stored in local memory.

7. The method of claim 5 , wherein a plurality of locked slice name ranges corresponding to a plurality of currently active write locks are retrieved, wherein the plurality of currently active write locks correspond to a plurality of write slice requests received from a plurality of requesting entities, and wherein an intersection of the plurality of locked slice name ranges is null.

8. The method of claim 5 , wherein the write lock conflict is determined to exist in response to determining that an intersection between the slice name range and the at least one locked slice name range is non-null.

9. The method of claim 8 , wherein the intersection between the slice name range and the at least one locked slice name range is a proper subset of the slice name range and is a proper subset of the at least one locked slice name range.

10. The method of claim 8 , further comprising, when the write lock conflict is determined to exist:

queuing the write slice request in local memory;

determining the intersection between the slice name range and the at least one locked slice name range is null, wherein the intersection between the slice name range and the at least one locked slice name range becomes null in response to a set of slice names included in the intersection changing from a status of locked to not locked;

initiating local storage of the plurality of encoded data slices;

issuing a favorable write slice response to the requesting entity; and

indicating that the slice name range is not locked when completing the local storage of the plurality of encoded data slices.

11. The method of claim 1 , further comprising:

receiving a second write slice request from a second requesting entity, wherein the second write slice request is received prior to receiving the write slice request from the requesting entity, wherein the second write slice request includes a second plurality of encoded data slices and a second corresponding plurality of slice names, and wherein the write lock conflict is determined to not exist in response to determining an intersection between the slice name range and a second slice name range determined for the second plurality of encoded data slices is null; and

facilitating local storage of the second plurality of encoded data slices, wherein the local storage of the second plurality of encoded data slices is initiated prior to initiation of the local storage of the plurality of encoded data slices, and wherein the local storage of the second plurality of encoded data slices is completed after initiation of the local storage of the plurality of encoded data slices.

12. A processing system of a dispersed storage and task (DST) execution unit comprises:

at least one processor;

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

receive a write slice request from a requesting entity, wherein the write slice request includes a plurality of encoded data slices and a corresponding plurality of slice names;

interpret the plurality of slice names to produce a slice name range;

determine whether a write lock conflict exists based on the slice name range;

issue an unfavorable write slice response to the requesting entity when the write lock conflict is determined to exist;

when the write lock conflict is determined to not exist:

initiate local storage of the plurality of encoded data slices;

issue a favorable write slice response to the requesting entity; and

indicate that the slice name range is not locked when completing the local storage of the plurality of encoded data slices.

13. The processing system of claim 12 , wherein the plurality of encoded data slices are associated with at least one data segment, and wherein the at least one data segment was dispersed storage error encoded to produce the plurality of encoded data slices for storage in a set of storage units that includes the DST execution unit.

14. The processing system of claim 12 , wherein the operational instructions, when executed by the at least one processor, further cause the processing system to indicate that the slice name range is locked prior to initiating local storage of the plurality of encoded data slices.

15. The processing system of claim 12 , wherein determining whether a write lock conflict exists includes retrieving at least one locked slice name range corresponding to at least one currently active write lock, and further includes comparing the slice name range to the at least one locked slice name range.

16. The processing system of claim 15 , wherein the at least one locked slice name range is retrieved from a locked slice name range list stored in local memory, and wherein indicating that the slice name range is not locked includes updating the locked slice name range list stored in local memory.

17. The processing system of claim 15 , wherein the write lock conflict is determined to exist in response to determining that an intersection between the slice name range and the at least one locked slice name range is non-null.

18. The processing system of claim 17 , wherein the operational instructions, when executed by the at least one processor, further cause the processing system to, when the write lock conflict is determined to exist:

queue the write slice request in local memory;

determine the intersection between the slice name range and the at least one locked slice name range is null, wherein the intersection between the slice name range and the at least one locked slice name range becomes null in response to a set of slice names included in the intersection changing from a status of locked to not locked;

initiate local storage of the plurality of encoded data slices;

issue a favorable write slice response to the requesting entity; and

indicate that the slice name range is not locked when completing the local storage of the plurality of encoded data slices.

19. The processing system of claim 12 , wherein the operational instructions, when executed by the at least one processor, further cause the processing system to:

receive a second write slice request from a second requesting entity, wherein the second write slice request is received prior to receiving the write slice request from the requesting entity, wherein the second write slice request includes a second plurality of encoded data slices and a second corresponding plurality of slice names, and wherein the write lock conflict is determined to not exist in response to determining an intersection between the slice name range and a second slice name range determined for the second plurality of encoded data slices is null; and

facilitate local storage of the second plurality of encoded data slices, wherein the local storage of the second plurality of encoded data slices is initiated prior to initiation of the local storage of the plurality of encoded data slices, and wherein the local storage of the second plurality of encoded data slices is completed after initiation of the local storage of the plurality of encoded data slices.

20. A non-transitory computer 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:

receive a write slice request from a requesting entity, wherein the write slice request includes a plurality of encoded data slices and a corresponding plurality of slice names;

interpret the plurality of slice names to produce a slice name range;

determine whether a write lock conflict exists based on the slice name range;

issue an unfavorable write slice response to the requesting entity when the write lock conflict is determined to exist;

when the write lock conflict is determined to not exist:

initiate local storage of the plurality of encoded data slices;

issue a favorable write slice response to the requesting entity; and

indicate that the slice name range is not locked when completing the local storage of the plurality of encoded data slices.