Task Scheduling in Cloud Computing Environment Using Bumble Bee Mating Algorithm

被引:3
作者
Alotaibi, Mohammad T. [1 ]
Almalag, Mohammad S. [2 ]
Werntz, Kyle [2 ]
机构
[1] Al Imam Muhammad Ibn Saud Islamic Univ, Dept Comp Sci, Riyadh, Saudi Arabia
[2] Christopher Newport Univ, Dept Phys Comp Sci & Engn, Newport News, VA 23606 USA
来源
2020 IEEE GLOBAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND INTERNET OF THINGS (GCAIOT) | 2020年
关键词
task scheduling; cloud computing; bumble bee mating; honey bee mating; path relinking; heterogeneous cloud computing; OPTIMIZATION ALGORITHM; ALLOCATION;
D O I
10.1109/GCAIOT51063.2020.9345824
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Tasks scheduling in cloud computing environment plays an important role for both Cloud Service Providers (CSPs) and the users of the services provided. Therefore, designing an efficient task scheduling algorithm, which fulfill the requirements of CSPs and their clients is essential. Several scheduling algorithms are proposed by various researchers for task scheduling in cloud computing environments. This paper introduces an alternative method for cloud task scheduling problem, which aims to minimize makespan of executing a number tasks on different Virtual Machines (VMs). This method is based on Bumble Bee Mating Optimization (BBMO) algorithm. BBMO is powered by the features of swarm intelligence and local search algorithms. The performance of BBMO is compared to two existing algorithms, Honey Bee Mating Optimization (HBMO) algorithm and Genetic Algorithm (GA). Finally, we analyze the performance of the proposed algorithm with other two algorithms using different scenarios of experiments. The results show that the proposed algorithm (BBMO) outperforms other algorithms.
引用
收藏
页码:8 / 13
页数:6
相关论文
共 31 条
[1]  
Ali S., 2000, Journal of Applied Science and Engineering, V3, P195
[2]   Materialized view selection using bumble bee mating optimization [J].
Arun, Biri ;
Vijay Kumar, T.V. .
International Journal of Decision Support System Technology, 2017, 9 (03) :1-27
[3]   Enhanced Particle Swarm Optimization For Task Scheduling In Cloud Computing Environments [J].
Awad, A. I. ;
El-Hefnawy, N. A. ;
Kader, H. M. Abdel .
INTERNATIONAL CONFERENCE ON COMMUNICATIONS, MANAGEMENT, AND INFORMATION TECHNOLOGY (ICCMIT'2015), 2015, 65 :920-929
[4]   Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions [J].
Braun, Tracy D. ;
Siegel, Howard Jay ;
Maciejewski, Anthony A. ;
Hong, Ye .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2008, 68 (11) :1504-1516
[5]  
Calheiros R. N., 2009, ARXIV PREPRINT ARXIV
[6]  
Fang YQ, 2019, PROCEEDINGS OF 2019 IEEE 3RD INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC 2019), P852, DOI [10.1109/ITNEC.2019.8728996, 10.1109/itnec.2019.8728996]
[7]   Variable neighborhood search: Principles and applications [J].
Hansen, P ;
Mladenovic, N .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 130 (03) :449-467
[8]  
Hansen P., 2014, Search methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, P313
[9]  
Jana Bappaditya, 2019, Soft Computing: Theories and Applications. Proceedings of SoCTA 2017. Advances in Intelligent Systems and Computing (AISC 742), P525, DOI 10.1007/978-981-13-0589-4_49
[10]  
Jiang Y., 2015, MATH PROBL ENG, V2015