A Modified Black Hole-Based Multi-Objective Workflow Scheduling Improved Using the Priority Queues for Cloud Computing Environment

被引:0
作者
Ebadifard, Fatemeh [1 ]
Babamir, Seyed Morteza [1 ]
机构
[1] Univ Kashan, Dept Comp, Kashan, Iran
来源
2018 4TH INTERNATIONAL CONFERENCE ON WEB RESEARCH (ICWR) | 2018年
关键词
Cloud Computing; Multi Objective; Priority; Black Hole; GENETIC ALGORITHM;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The workflow scheduling problem is one of the most important challenges in cloud computing, which should be considered by cloud data providers in data centers. Since goals other than makespan should be considered in the real-world scheduling and these goals are contradictor in most cases, the workflow scheduling problem is a NP-Hard problem. Considering the complexities of the scheduling problem, multi-objective metaheuristic algorithms are a good option for solving such problems. These algorithms help service providers find a set of optimal tradeoffs of solutions. An important criterion in finding this tradeoff is diversity in the choice of solutions. By adding this criterion to the multi-objective evolutionary algorithms, one can achieve a set of optimal solutions. Given the importance of this criterion, we extended the Black Hole heuristic algorithm and then presented a new multi-objective algorithm based on the diversity criteria for workflow scheduling in the cloud environment. The purpose of the proposed algorithm is to search for the problem space and find the non-dominated Pareto front to optimize the Resource efficiency, Makespan and Cost factors in the cloud environment. In order to achieve this goal, we not only increased the diversity of solutions, but also modified the layout type of initial solutions based on the priority of requests in the workflow, and created a more appropriate initial generation to enhance the purposefulness of our search. The results obtained from the Workflow Sim show that the proposed method improves the balanced and unbalanced workflow better than do the known algorithms of SPEA2 and NSGA2 and PBHO.
引用
收藏
页码:162 / 167
页数:6
相关论文
共 19 条
[1]  
[Anonymous], CONCURRENCY COMPUTAT
[2]  
[Anonymous], 103 GLOR
[3]  
[Anonymous], MULTIOBJECTIVE CAT S
[4]  
Bharathi S., 2008, 2008 3 WORKSHOP WORK, P1
[5]   CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms [J].
Calheiros, Rodrigo N. ;
Ranjan, Rajiv ;
Beloglazov, Anton ;
De Rose, Cesar A. F. ;
Buyya, Rajkumar .
SOFTWARE-PRACTICE & EXPERIENCE, 2011, 41 (01) :23-50
[6]   An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP) [J].
Chaharsooghi, S. K. ;
Kermani, Amir H. Meimand .
APPLIED MATHEMATICS AND COMPUTATION, 2008, 200 (01) :167-177
[7]  
Cheng WD, 2012, STRUCT BOND, V144, P1, DOI [10.1007/430_2011_64, 10.1109/ICADE.2012.6330087]
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]  
Ebadifard F., 2017, P INT C YOUNG RES IN, V1852
[10]  
Ebadifard F, 2017, 2017 3RD INTERNATIONAL CONFERENCE ON WEB RESEARCH (ICWR), P102, DOI 10.1109/ICWR.2017.7959313