Process demand prediction for distributed power and resource management
First Claim
1. A method for allocating resources in a virtual desktop environment, the method comprising:
- making a prediction for future demand by a plurality of processes running on a first host and a second host, the prediction being based on each process demand history and on removing past process demand glitches, including defining the process demand history on which the prediction is based by identifying any past process demand glitch and by including stable periods while excluding any identified past process demand glitch between the stable periods;
selecting a candidate process for movement, the candidate process being one of the plurality of processes;
performing a cost and benefit analysis for moving the candidate process from the plurality of processes from the first host to the second host based on the prediction, the cost and benefit analysis being specific to the candidate process; and
executing a move of the candidate process when the cost and benefit analysis recommends the move;
wherein removing past process demand glitches further includes,finding a glitch in process demand as an unstable period between first and second stable periods, including identifying the glitch by comparing adjacent samples of process demands to identify unstable samples and then grouping the unstable samples for determining whether a group of the unstable samples is a glitch, andremoving the glitch in process demand when a load of the second stable period is within a demand variation threshold from a load of the first stable period, such that the prediction is based on a combination of the first and second stable periods after removal of the glitch.
2 Assignments
0 Petitions
Accused Products
Abstract
Methods and systems for allocating resources in a virtual desktop resource environment are provided. A method includes making a prediction on the future demand for processes running on a distributed environment with several hosts. The prediction is based on the process demand history and includes the removal of historic process demand glitches. Further, the prediction is used to perform a cost and benefit analysis for moving a candidate process from one host to another, and the candidate process is moved to a different host when the cost and benefit analysis recommends such move. In another embodiment, the predictions on future process demand are used for distributed power management by putting hosts in stand-by mode when the overall demand decreases or by adding hosts to the distributed environment when the load increases.
-
Citations
19 Claims
-
1. A method for allocating resources in a virtual desktop environment, the method comprising:
-
making a prediction for future demand by a plurality of processes running on a first host and a second host, the prediction being based on each process demand history and on removing past process demand glitches, including defining the process demand history on which the prediction is based by identifying any past process demand glitch and by including stable periods while excluding any identified past process demand glitch between the stable periods; selecting a candidate process for movement, the candidate process being one of the plurality of processes; performing a cost and benefit analysis for moving the candidate process from the plurality of processes from the first host to the second host based on the prediction, the cost and benefit analysis being specific to the candidate process; and executing a move of the candidate process when the cost and benefit analysis recommends the move; wherein removing past process demand glitches further includes, finding a glitch in process demand as an unstable period between first and second stable periods, including identifying the glitch by comparing adjacent samples of process demands to identify unstable samples and then grouping the unstable samples for determining whether a group of the unstable samples is a glitch, and removing the glitch in process demand when a load of the second stable period is within a demand variation threshold from a load of the first stable period, such that the prediction is based on a combination of the first and second stable periods after removal of the glitch. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A virtual desktop resource allocation system, the system comprising:
-
a plurality of hosts in a virtual center; a process running in a first host from the plurality of hosts; and a distributed resource manager in the virtual center, wherein the distributed resource manager, predicts a future demand for the process based on an extended history of process demand and on removing past process demand glitches from determinations of the process demand in order to define the extended history, including defining the process demand history on which the prediction is based by including stable periods while excluding any identified past process demand glitch between the stable periods; performs a cost and benefit analysis for moving the process to a second host from the plurality of hosts based on the prediction, and moves the process to the second host when the cost and benefit analysis recommends the move wherein removing past process demand glitches further includes, finding a glitch in process demand as an unstable period between first and second stable periods, including identifying the glitch by comparing adjacent samples of process demands to identify unstable samples and then grouping the unstable samples for determining whether a group of the unstable samples is a glitch, and removing the glitch in process demand when a load of the second stable period is within a demand variation threshold from a load of the first stable period, such that the prediction is based on a combination of the first and second stable periods after removal of the glitch. - View Dependent Claims (9, 10, 11, 12, 13)
-
-
14. A computer program embedded in a non-transitory computer-readable medium, when executed by one or more processors, for distributed power management, the computer program comprising:
-
program instructions for making a prediction for future demand by a plurality of processes running on a plurality of hosts, the prediction being based on each process demand history and on removing past process demand glitches, the process demand history being over a period of time that includes at least one stable period and that excludes any past process demand glitches that are identified as being between two stable periods which are included for making the prediction; program instructions for performing a first cost and benefit analysis for changing a number of hosts running; program instructions for shutting down a host when the first cost and benefit analysis recommends reducing a number of running hosts; and program instructions for starting up a stand-by host when the first cost and benefit analysis recommends incrementing the number of running hosts wherein removing past process demand glitches further includes, finding a glitch in process demand as an unstable period between first and second stable periods, including identifying the glitch by comparing adjacent samples of process demands to identify unstable samples and then grouping the unstable samples for determining whether a group of the unstable samples is a glitch, and removing the glitch in process demand when a load of the second stable period is within a demand variation threshold from a load of the first stable period, such that the prediction is based on a combination of the first and second stable periods after removal of the glitch. - View Dependent Claims (15, 16, 17, 18, 19)
-
Specification