Allocating rebuilding queue entries in a dispersed storage network

A processing system of a dispersed storage and task network (DSTN) 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 operations including:
• identifying a slice name of a slice in error of a set of slices stored in a set of dispersed storage (DS) units;
• identifying a number of slice errors of the set of slices;
• generating a queue entry that includes the slice name of the slice in error, a rebuilding task indicator, an identity of the set of slices, and the number of slice errors;
• identifying a rebuilding queue based on the number of slice errors, wherein the rebuilding queue is associated with one of:
• the set of DS units or another set of DS units;
• and
• storing the queue entry in the identified rebuilding queue.

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 perform operations including:
• identifying a slice name of a slice in error of a set of slices stored in a set of dispersed storage (DS) units;
• identifying a number of slice errors of the set of slices;
• generating a queue entry that includes the slice name of the slice in error, a rebuilding task indicator, an identity of the set of slices, and the number of slice errors;
• identifying a rebuilding queue based on the number of slice errors, wherein the rebuilding queue is associated with one of:
• the set of DS units or another set of DS units;
• and
• storing the queue entry in the identified rebuilding queue.