In IaaS Cloud,different mapping relationships between virtual machines(VMs)and physical machines(PMs)cause different resource utilization,so how to place VMs on PMs to reduce energy consumption is becoming one of the ...In IaaS Cloud,different mapping relationships between virtual machines(VMs)and physical machines(PMs)cause different resource utilization,so how to place VMs on PMs to reduce energy consumption is becoming one of the major concerns for cloud providers.The existing VM scheduling schemes propose optimize PMs or network resources utilization,but few of them attempt to improve the energy efficiency of these two kinds of resources simultaneously.This paper proposes a VM scheduling scheme meeting multiple resource constraints,such as the physical server size(CPU,memory,storage,bandwidth,etc.)and network link capacity to reduce both the numbers of active PMs and network elements so as to finally reduce energy consumption.Since VM scheduling problem is abstracted as a combination of bin packing problem and quadratic assignment problem,which is also known as a classic combinatorial optimization and NP-hard problem.Accordingly,we design a twostage heuristic algorithm to solve the issue,and the simulations show that our solution outperforms the existing PM-or network-only optimization solutions.展开更多
基金the National Natural Science Foundation of China,the National High Technology Research and Development Program of China(863 Program)the Fundamental Research Funds for the Central Universities+1 种基金the Natural Science Foundation of Gansu Province,Chinathe Open Fund of the State Key Laboratory of Software Development Environment
文摘In IaaS Cloud,different mapping relationships between virtual machines(VMs)and physical machines(PMs)cause different resource utilization,so how to place VMs on PMs to reduce energy consumption is becoming one of the major concerns for cloud providers.The existing VM scheduling schemes propose optimize PMs or network resources utilization,but few of them attempt to improve the energy efficiency of these two kinds of resources simultaneously.This paper proposes a VM scheduling scheme meeting multiple resource constraints,such as the physical server size(CPU,memory,storage,bandwidth,etc.)and network link capacity to reduce both the numbers of active PMs and network elements so as to finally reduce energy consumption.Since VM scheduling problem is abstracted as a combination of bin packing problem and quadratic assignment problem,which is also known as a classic combinatorial optimization and NP-hard problem.Accordingly,we design a twostage heuristic algorithm to solve the issue,and the simulations show that our solution outperforms the existing PM-or network-only optimization solutions.
