Techniques for placing applications in heterogeneous virtualized systems while minimizing power and migration cost
View Patent ↗N applications are placed on M virtualized servers having power management capability. A time horizon is divided into a plurality of time windows, and, for each given one of the windows, a placement of the N applications is computed, taking into account power cost, migration cost, and performance benefit. The migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for the given one of the windows. The N applications are placed onto the M virtualized servers, for each of the plurality of time windows, in accordance with the placement computed in the computing step for each of the windows. In an alternative aspect, power cost and performance benefit, but not migration cost, are taken into account; there are a plurality of virtual machines; and the computing step includes, for each of the windows, determining a target utilization for each of the servers based on a power model for each given one of the servers; picking a given one of the servers with a least power increase per unit increase in capacity, until capacity has been allocated to fit all the virtual machines; and employing a first fit decreasing bin packing technique to compute placement of the applications on the virtualized servers.
1. A method for placing N applications on M virtualized servers, said servers having power management capability, said method comprising the steps of:
dividing a time horizon into a plurality of time windows;
for each given one of said windows, computing a placement of said N applications, taking into account power cost, migration cost, and performance benefit, wherein said migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for said given one of said windows; and
placing said N applications onto said M virtualized servers, for each of said plurality of time windows, in accordance with said placement computed in said computing step for each of said windows.
2. A computer program product comprising a tangible computer useable storage medium including computer usable program code for placing N applications on M virtualized servers, said servers having power management capability, said computer program product including:
dividing a time horizon into a plurality of time windows;
for each given one of said windows, computing a placement of said N applications, taking into account power cost and performance benefit; and
placing said N applications onto said M virtualized servers, for each of said plurality of time windows, in accordance with said placement computed in said computing step for each of said windows;
wherein there are a plurality of virtual machines, and wherein said computing step comprises, for each of said windows:
determining a target utilization for each of said servers based on a power model for each given one of said servers;
picking a given one of said servers with a least power increase per unit increase in capacity, until capacity has been allocated to fit all said virtual machines; and
employing a first fit decreasing bin packing technique to compute placement of said applications on said virtualized servers.
3. A computer program product comprising a tangible computer useable storage medium including computer usable program code for placing N applications on M virtualized servers, said servers having power management capability, said computer program product including:
computer usable program code for dividing a time horizon into a plurality of time windows;
computer usable program code for, for each given one of said windows, computing a placement of said N applications, taking into account power cost, migration cost, and performance benefit, wherein said migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for said given one of said windows; and
computer usable program code for placing said N applications onto said M virtualized servers, for each of said plurality of time windows, in accordance with said placement computed in said computing step for each of said windows.
4. A system for placing N applications on M virtualized servers, said servers having power management capability, said system comprising:
a memory; and
at least one processor, coupled to said memory, and operative to:
divide a time horizon into a plurality of time windows;
for each given one of said windows, compute a placement of said N applications, taking into account power cost, migration cost, and performance benefit, wherein said migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for said given one of said windows; and
place said N applications onto said M virtualized servers, for each of said plurality of time windows, in accordance with said placement computed in said computing step for each of said windows.