Scheduling requests based on resource information

A processing system of a request scheduler of a storage unit comprising multiple memory devices, the request scheduler comprising:

• 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:
• determine resource requirements for each request of a set of incoming requests to be executed at the storage unit, wherein the set of incoming requests are received from at least one request issuer;
• send a query to a backing store of the storage unit requesting a location of data associated with each request of the set of incoming requests;
• receive location data from the backing store in response to the query;
• determine current resource availability data for resources indicated in the resource requirements, the resource availability data including storage locations of currently stored data in one or more of the multiple memory devices;
• determine, based on the current resource availability data, a level of contention for shared resources between the set of incoming requests and:
• (a) one or more scheduled requests queued by the request scheduler and not yet executed, and (b) one or more tasks that are currently being executed by the storage unit;
• generate scheduling data for the set of requests based on the level of contention for shared resources, wherein generating the scheduling data includes identifying a first subset of the set of requests to be queued and a second subset of the set of requests to be immediately, simultaneously executed based on determining that a sum of portions of bandwidth resources, memory resources and processor resources required by the second subset of the set of requests does not exceed currently available bandwidth resources, memory resources, and processing resources;
• add the first subset of the set of requests to a queue maintained by the request scheduler in response to the scheduling data indicating the first subset of the set of requests be queued for execution;
• facilitate execution of the set of requests within the storage unit in accordance with the scheduling data by facilitating immediate, simultaneous execution of the second subset of the set of requests and by facilitating serial execution of the first subset of the set of requests;
• and
• remove the first subset of the set of requests from the queue in response to facilitating execution of the first subset of the set of requests.

A computer readable storage medium comprises:

• at least one memory section that stores operational instructions that, when executed by a processing system of a request scheduler that includes a processor and a memory, causes the processing system of the request scheduler to:
• determine resource requirements for each request of a set of incoming requests to be executed at a local storage unit comprising multiple memory devices, wherein the set of incoming requests are received from at least one request issuer;
• send a query to a backing store of the storage unit requesting a location of data associated with each request of the set of incoming requests;
• receive location data from the backing store in response to the query;
• determine current resource availability data for resources indicated in the resource requirements, the resource availability data including storage locations of currently stored data in one or more of the multiple memory devices;
• determine, based on the current resource availability data, a level of contention for shared resources between the set of incoming requests and:
• (a) one or more scheduled requests queued by the request scheduler and not yet executed, and (b) one or more tasks that are currently being executed by the local storage unit;
• generate scheduling data for the set of requests based on the level of contention for shared resources, wherein generating the scheduling data includes identifying a first subset of the set of requests to be queued and a second subset of the set of requests to be immediately, simultaneously executed based on determining that a sum of portions of bandwidth resources, memory resources and processor resources required by the second subset of the set of requests does not exceed currently available bandwidth resources, memory resources, and processing resources;
• add the first subset of the set of requests to a queue maintained by the request scheduler in response to the scheduling data indicating the first subset of the set of requests be queued for execution;
• facilitate execution of the set of requests within the local storage unit in accordance with the scheduling data by facilitating immediate, simultaneous execution of the second subset of the set of requests and by facilitating serial execution of the first subset of the set of requests;
• and
• remove the first subset of the set of requests from the queue in response to facilitating execution of the first subset of the set of requests.