Autonomic cloud resource provisioning and scheduling using meta-heuristic algorithm

被引:29
作者
Kumar, Mohit [1 ]
Sharma, S. C. [2 ]
Goel, Shalini [3 ]
Mishra, Sambit Kumar [4 ]
Husain, Akhtar [5 ]
机构
[1] NIT Jalandhar, Jalandhar, Punjab, India
[2] IIT Roorkee, Roorkee, Uttar Pradesh, India
[3] MIET Meerut, Meerut, Uttar Pradesh, India
[4] SRM Univ, Amravati, Andhra Pradesh, India
[5] MJPRU Bareilly, Bareilly, Uttar Pradesh, India
关键词
Energy consumption; Resource provisioning; Resource scheduling; Meta-heuristic; Binary PSO; LOAD BALANCING ALGORITHM; GENETIC ALGORITHM; OPTIMIZATION; ENVIRONMENT; STRATEGY; TASKS;
D O I
10.1007/s00521-020-04955-y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We investigate that resource provisioning and scheduling is a prominent problem due to heterogeneity as well as dispersion of cloud resources. Cloud service providers are building more and more datacenters due to demand of high computational power which is a serious threat to environment in terms of energy requirement. To overcome these issues, we need an efficient meta-heuristic technique that allocates applications among the virtual machines fairly and optimizes the quality of services (QoS) parameters to meet the end user objectives. Binary particle swarm optimization (BPSO) is used to solve real-world discrete optimization problems but simple BPSO does not provide optimal solution due to improper behavior of transfer function. To overcome this problem, we have modified transfer function of binary PSO that provides exploration and exploitation capability in better way and optimize various QoS parameters such as makespan time, energy consumption, and execution cost. The computational results demonstrate that modified transfer function-based BPSO algorithm is more efficient and outperform in comparison with other baseline algorithm over various synthetic datasets.
引用
收藏
页码:18285 / 18303
页数:19
相关论文
共 43 条
[1]  
[Anonymous], 2007, P 21 INT PAR DISTR P, DOI DOI 10.1109/IPDPS.2007.370510
[2]  
[Anonymous], SOFT COMPUTING
[3]   Honey bee behavior inspired load balancing of tasks in cloud computing environments [J].
Babu, Dhinesh L. D. ;
Krishna, P. Venkata .
APPLIED SOFT COMPUTING, 2013, 13 (05) :2292-2303
[4]   A Modified Binary Particle Swarm Optimization for Knapsack Problems [J].
Bansal, Jagdish Chand ;
Deep, Kusum .
APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (22) :11042-11061
[5]   The case for energy-proportional computing [J].
Barroso, Luiz Andre ;
Hoelzle, Urs .
COMPUTER, 2007, 40 (12) :33-+
[6]   ERECT: Energy-efficient reactive scheduling for real-time tasks in heterogeneous virtualized clouds [J].
Chen, Huangke ;
Liu, Guipeng ;
Yin, Shu ;
Liu, Xiaocheng ;
Qiu, Dishan .
JOURNAL OF COMPUTATIONAL SCIENCE, 2018, 28 :416-425
[7]   A hybrid meta-heuristic algorithm for VM scheduling with load balancing in cloud computing [J].
Cho, Keng-Mao ;
Tsai, Pang-Wei ;
Tsai, Chun-Wei ;
Yang, Chu-Sing .
NEURAL COMPUTING & APPLICATIONS, 2015, 26 (06) :1297-1309
[8]   A Genetic Algorithm (GA) based Load Balancing Strategy for Cloud Computing [J].
Dasgupta, Kousik ;
Mandal, Brototi ;
Dutta, Paramartha ;
Mondal, Jyotsna Kumar ;
Dam, Santanu .
FIRST INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE: MODELING TECHNIQUES AND APPLICATIONS (CIMTA) 2013, 2013, 10 :340-347
[9]  
Devi D Chitra, 2016, ScientificWorldJournal, V2016, P3896065, DOI 10.1155/2016/3896065
[10]  
Elzeki O.M., 2012, Int. J. Comput. Appl., V50, P22, DOI [10.5120/7823-1009, DOI 10.5120/7823-1009]