Queue management system and method
A method, computer program product, and computing system for: receiving an indication that a specific request has been completely processed on an IT computing device; analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing based, at least in part, upon: a root request limit of the IT computing device, a global request limit of the IT computing device, and a sibling status of the specific request.
1. A computer-implemented method, executed on a computing device, comprising:
receiving an indication that a specific request has been completely processed on an IT computing device;
analyzing, by a processing node of the IT computing device, a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request, resulting in an identified target queued request, for processing based, at least in part, upon:
a root request limit of the IT computing device,
a global request limit of the IT computing device, and
a sibling status of the specific request;
wherein the identified target queued request is one or both of an oldest and a highest priority queued request.
2. The computer-implemented method of claim 1 wherein:
the root request limit is the maximum number of requests that may concurrently be running on the IT computing device when adding a new root request;
the global request limit is the maximum number of requests that may concurrently be running on the IT computing device when adding any new request; and
the sibling status of the specific request defines whether the specific request has any siblings.
3. The computer-implemented method of claim 2 wherein the IT computing device is currently under the root request limit and analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing includes:
identifying the oldest and/or highest priority queued request within the plurality of queued requests as the target queued request for processing on the IT computing device.
4. The computer-implemented method of claim 3 wherein:
the pending queue includes a global queue; and
the oldest and/or highest priority queued request is defined within the global queue.
5. The computer-implemented method of claim 2 wherein the IT computing device is currently over the root request limit but under the global request limit and analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing includes:
identifying the oldest and/or highest priority queued non-root request within the plurality of queued requests as the target queued request for processing on the IT computing device.
6. The computer-implemented method of claim 5 wherein:
the pending queue includes a child queue; and
the oldest and/or highest priority queued non-root request is defined within the child queue.
7. The computer-implemented method of claim 2 wherein the IT computing device is currently over the global request limit and analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing includes:
identifying the oldest and/or highest priority queued sibling of the specific request within the plurality of queued requests as the target queued request for processing on the IT computing device if the specific request has one or more siblings in the pending queue and no siblings currently being processed by the IT computing device.
8. The computer-implemented method of claim 7 wherein:
the pending queue includes a sibling queue; and
the oldest and/or highest priority queued sibling of the specific request is defined within the sibling queue.
9. A computer program product residing on a computer readable medium having a plurality of instructions stored thereon which, when executed by a processor, cause the processor to perform operations comprising:
receiving an indication that a specific request has been completely processed on an IT computing device;
analyzing, by a processing node of the IT computing device, a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request, resulting in an identified target queued request, for processing based, at least in part, upon:
a root request limit of the IT computing device,
a global request limit of the IT computing device, and
a sibling status of the specific request;
wherein the identified target queued request is one or both of an oldest and a highest priority queued request.
10. The computer program product of claim 9 wherein:
the root request limit is the maximum number of requests that may concurrently be running on the IT computing device when adding a new root request;
the global request limit is the maximum number of requests that may concurrently be running on the IT computing device when adding any new request; and
the sibling status of the specific request defines whether the specific request has any siblings.
11. The computer program product of claim 10 wherein the IT computing device is currently under the root request limit and analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing includes:
identifying the oldest and/or highest priority queued request within the plurality of queued requests as the target queued request for processing on the IT computing device.
12. The computer program product of claim 11 wherein:
the pending queue includes a global queue; and
the oldest and/or highest priority queued request is defined within the global queue.
13. The computer program product of claim 10 wherein the IT computing device is currently over the root request limit but under the global request limit and analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing includes:
identifying the oldest and/or highest priority queued non-root request within the plurality of queued requests as the target queued request for processing on the IT computing device.
14. The computer program product of claim 13 wherein:
the pending queue includes a child queue; and
the oldest and/or highest priority queued non-root request is defined within the child queue.
15. The computer program product of claim 10 wherein the IT computing device is currently over the global request limit and analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing includes:
identifying the oldest and/or highest priority queued sibling of the specific request within the plurality of queued requests as the target queued request for processing on the IT computing device if the specific request has one or more siblings in the pending queue and no siblings currently being processed by the IT computing device.
16. The computer program product of claim 15 wherein:
the pending queue includes a sibling queue; and
the oldest and/or highest priority queued sibling of the specific request is defined within the sibling queue.
17. A computing system including a processor and memory configured to perform operations comprising:
receiving an indication that a specific request has been completely processed on an IT computing device;
analyzing, by a processing node of the IT computing device, a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request, resulting in an identified target queued request, for processing based, at least in part, upon:
a root request limit of the IT computing device,
a global request limit of the IT computing device, and
a sibling status of the specific request;
wherein the identified target queued request is one or both of an oldest and a highest priority queued request.
18. The computing system of claim 17 wherein:
the root request limit is the maximum number of requests that may concurrently be running on the IT computing device when adding a new root request;
the global request limit is the maximum number of requests that may concurrently be running on the IT computing device when adding any new request; and
the sibling status of the specific request defines whether the specific request has any siblings.
19. The computing system of claim 18 wherein the IT computing device is currently under the root request limit and analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing includes:
identifying the oldest and/or highest priority queued request within the plurality of queued requests as the target queued request for processing on the IT computing device.
20. The computing system of claim 19 wherein:
the pending queue includes a global queue; and
the oldest and/or highest priority queued request is defined within the global queue.
21. The computing system of claim 18 wherein the IT computing device is currently over the root request limit but under the global request limit and analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing includes:
identifying the oldest and/or highest priority queued non-root request within the plurality of queued requests as the target queued request for processing on the IT computing device.
22. The computing system of claim 21 wherein:
the pending queue includes a child queue; and
the oldest and/or highest priority queued non-root request is defined within the child queue.
23. The computing system of claim 18 wherein the IT computing device is currently over the global request limit and analyzing a plurality of queued requests within a pending queue of the IT computing device to identify a target queued request for processing includes:
identifying the oldest and/or highest priority queued sibling of the specific request within the plurality of queued requests as the target queued request for processing on the IT computing device if the specific request has one or more siblings in the pending queue and no siblings currently being processed by the IT computing device.
24. The computing system of claim 23 wherein:
the pending queue includes a sibling queue; and
the oldest and/or highest priority queued sibling of the specific request is defined within the sibling queue.