Patent ID: 9400682
Filing Date: 2016-07-26
CPC Classification: G06F

Claim Text:
1. A method for adaptively ranking and scheduling a plurality of monitoring tasks, comprising: utilizing a processing resource to execute instructions stored on a non-transitory medium to: analyze historical measurements from execution of the plurality of monitoring tasks in a single execution queue, wherein to analyze includes to determine an increase in starvation indicators for each of the plurality of monitoring tasks in the single execution queue, wherein the starvation indicators include a first quantity of instances of a first monitoring task of the number of monitoring tasks in the single execution queue being outrun by a second monitoring task of the plurality of monitoring tasks in the single execution queue; determine an updated ranking for each of the plurality of monitoring tasks within the single execution queue based on the analysis of the historical measurements, wherein to determine includes to increase a ranking of the first monitoring task when the first quantity of instances of the first monitoring task in the single execution queue being outrun by the second monitoring task in the single execution queue is greater than a previous quantity of instances, and wherein to determine includes to decrease a ranking of a third monitoring task of the plurality of monitoring tasks in the single execution queue when the third monitoring task has historically ran for a longer period of time relative to a fourth monitoring task of the plurality of monitoring tasks in the single execution queue; and schedule an order of execution for each of the plurality of monitoring tasks in the single execution queue based on the updated ranking for each of the plurality of monitoring tasks.