发明名称 Ranking and scheduling of monitoring tasks
摘要 Systems, methods, and machine-readable and executable instructions are provided for dynamically ranking and scheduling monitoring tasks. Dynamically ranking and scheduling monitoring tasks can include determining an updated ranking for each of a number of monitoring tasks, where the updated ranking can include analyzing historical measurements of each of the number of monitoring tasks. An order of execution can be scheduled for each of the number of monitoring tasks based on the updated ranking for each of the number of monitoring tasks.
申请公布号 US9400682(B2) 申请公布日期 2016.07.26
申请号 US201213706847 申请日期 2012.12.06
申请人 Hewlett Packard Enterprise Development LP 发明人 Persikov Sergey;Yeshoua Barak;Steuer Rotem;Medarov Rudy;Levi Atali;Cohen Ira;Assulin Ohad
分类号 G06F9/46;G06F9/48;G06F11/30 主分类号 G06F9/46
代理机构 Brooks, Cameron & Huebsch, PLLC 代理人 Brooks, Cameron & Huebsch, PLLC
主权项 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.
地址 Houston TX US