A hybrid meta-heuristic algorithm for VM scheduling with load balancing in cloud computing

被引:96
作者
Cho, Keng-Mao [1 ]
Tsai, Pang-Wei [1 ]
Tsai, Chun-Wei [2 ]
Yang, Chu-Sing [1 ]
机构
[1] Natl Cheng Kung Univ, Dept Elect Engn, Inst Comp & Commun Engn, Tainan 70101, Taiwan
[2] Natl Ilan Univ, Dept Comp Sci & Informat Engn, Yilan 26047, Taiwan
关键词
Scheduling; Load balance; Cloud computing; Ant colony optimization; Particle swarm optimization; ANT COLONY OPTIMIZATION;
D O I
10.1007/s00521-014-1804-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:1297 / 1309
页数:13
相关论文
共 55 条
[1]  
Alford T., 2009, The Economics of Cloud Computing, Addressing the Benefits of Infrastructure in the Cloud: Booz, Allen, and Hamilton
[2]  
Amazon, 2008, AM EL COMP CLOUD
[3]  
Amazon, 2008, AM SIMPL STOR SERV
[4]  
[Anonymous], 2008, Scheduling: Theory, Algorithms, and Systems
[5]   Metaheuristics in combinatorial optimization: Overview and conceptual comparison [J].
Blum, C ;
Roli, A .
ACM COMPUTING SURVEYS, 2003, 35 (03) :268-308
[6]  
Buyya R., 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, P283, DOI 10.1109/HPC.2000.846563
[7]   An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements [J].
Chen, Wei-Neng ;
Zhang, Jun .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2009, 39 (01) :29-43
[8]   Ant colony optimisation for task matching and scheduling [J].
Chiang, C-W. ;
Lee, Y-C. ;
Lee, C-N. ;
Chou, T-Y. .
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2006, 153 (06) :373-380
[9]  
Cho K, 2014, P SSST 8 8 WORKSH SY, P103, DOI [10.3115/v1/W14-4012, DOI 10.3115/V1/W14-4012, 10.3115/v1/w14-4012]
[10]  
Colorni A., 1994, BELGIAN J OPERATIONS, V34, P39