TY - JOUR
T1 - A hybrid meta-heuristic algorithm for VM scheduling with load balancing in cloud computing
AU - Cho, Keng Mao
AU - Tsai, Pang Wei
AU - Tsai, Chun Wei
AU - Yang, Chu Sing
PY - 2015/8/25
Y1 - 2015/8/25
N2 - Virtual machine (VM) scheduling with load balancing in cloud computing aims to assign VMs to suitable servers and balance the resource usage among all of the servers. In an infrastructure-as-a-service framework, there will be dynamic input requests, where the system is in charge of creating VMs without considering what types of tasks run on them. Therefore, scheduling that focuses only on fixed task sets or that requires detailed task information is not suitable for this system. This paper combines ant colony optimization and particle swarm optimization to solve the VM scheduling problem, with the result being known as ant colony optimization with particle swarm (ACOPS). ACOPS uses historical information to predict the workload of new input requests to adapt to dynamic environments without additional task information. ACOPS also rejects requests that cannot be satisfied before scheduling to reduce the computing time of the scheduling procedure. Experimental results indicate that the proposed algorithm can keep the load balance in a dynamic environment and outperform other approaches.
AB - Virtual machine (VM) scheduling with load balancing in cloud computing aims to assign VMs to suitable servers and balance the resource usage among all of the servers. In an infrastructure-as-a-service framework, there will be dynamic input requests, where the system is in charge of creating VMs without considering what types of tasks run on them. Therefore, scheduling that focuses only on fixed task sets or that requires detailed task information is not suitable for this system. This paper combines ant colony optimization and particle swarm optimization to solve the VM scheduling problem, with the result being known as ant colony optimization with particle swarm (ACOPS). ACOPS uses historical information to predict the workload of new input requests to adapt to dynamic environments without additional task information. ACOPS also rejects requests that cannot be satisfied before scheduling to reduce the computing time of the scheduling procedure. Experimental results indicate that the proposed algorithm can keep the load balance in a dynamic environment and outperform other approaches.
UR - http://www.scopus.com/inward/record.url?scp=84937972396&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937972396&partnerID=8YFLogxK
U2 - 10.1007/s00521-014-1804-9
DO - 10.1007/s00521-014-1804-9
M3 - Article
AN - SCOPUS:84937972396
VL - 26
SP - 1297
EP - 1309
JO - Neural Computing and Applications
JF - Neural Computing and Applications
SN - 0941-0643
IS - 6
ER -