A task scheduling algorithm based on an improved binary bat algorithm(IBBA-TA)is proposed to solve the problem of long completion time of tasks in sea service environments. The algorithm introduces nonlinear inertia weight factors in the optimization process of the binary bat algorithm(BBA)to balance capabilities of global and local searches. A perturbation term is constructed by using two mutually exclusive neighbor bats to avoid local optimums. Weights of both the global optimal operator and the neighbor bat operator are adjusted using an adaptive learning factor
and control the transition of the optimization process from global searches to local searches. Experimental results show that IBBA-TA stably obtains the global optimal value. Comparisons with the existing task scheduling algorithms based on the binary particle swarm optimization algorithm(BPSO)and the binary bat algorithm show that when the number of tasks is large
IBBA-TA avoids premature convergence and significantly reduces completion time of tasks. It is concluded that the algorithm can be used for task scheduling to improve the efficiency of processing large granularity services in sea service networks.
关键词
Keywords
references
ARMBRUST M, FOX A, GRIFFITH R, et al. A view of cloud computing [J]. Communications of the ACM, 2010, 53(4): 50-58.
BONOMI F, MILITO R, ZHU J, et al. Fog computing and its role in the internet of things [C]∥Proceedings of the First Edition of the MCC Workshop on Mobile Cloud Computing. New York, USA: ACM, 2012: 13-16.
FENG Songlin, NING Dejun, ZHANG Hongguang, et al. A survey on sea-cloud collaboration oriented common service [J]. Journal of Network New Media, 2014, 3(1): 1-7.
WANG Jinlin, TIAN Jing, YOU Jiali, et al. Research and design of an on-site, elastic, autonomous network: sea service system [J]. Scientia Sinica: Informationis, 2015, 45(10): 1237-1248.
QIAO Nannan, YOU Jiali, SHENG Yiqiang, et al. An efficient algorithm of discrete particle swarm optimization for multi-objective task assignment [J]. IEICE Transactions on Information and Systems, 2016(12): 2968-2977.
KHALILI A, BABAMIR S M. Makespan improvement of PSO-based dynamic scheduling in cloud environment [C]∥Proceedings of the 2015 23rd Iranian Conference on Electrical Engineering. Piscataway, NJ, USA: IEEE, 2015: 613-618.
LI Jian, HUANG Qingjia, LIU Yiyang, et al. A task scheduling algorithm for large graph processing cloud in computing [J]. Journal of Xi'an Jiaotong University, 2012, 46(12): 116-122.
YANG X S. A new metaheuristic bat-inspired algorithm [J]. Computer Knowledge Technology, 2010, 284: 65-74.
MIRJALILI S, MIRJALILI S M, YANG X S. Binary bat algorithm [J]. Neural Computing and Applications, 2014, 25(3): 663-681.
RODRIGUES D, PEREIRA L A M, NAKAMURA R Y M, et al. A wrapper approach for feature selection based on bat algorithm and optimum-path forest [J]. Expert Systems with Applications, 2014, 41(5): 2250 -2258.
LIU Yi, DIAO Xingchun, CAO Jianjun, et al. Catfish bat algorithm-ant colony optimization for subset problems [J]. Systems Engineering and Electronics, 2016, 38(10): 2441-2448.
RAGHAVAN S, MARIMUTHU C, SARWESH P, et al. Bat algorithm for scheduling workflow applications in cloud [C]∥Proceedings of the International Conference on Electronic Design, Computer Networks Automated Verification. Piscataway, NJ, USA: IEEE, 2015: 139-144.
YILMAZ S, KÜÇÜKSILLE E U. A new modification approach on bat algorithm for solving optimization problems [J]. Applied Soft Computing, 2014, 28(5): 259-275.
GANDOMI A H, YANG X S. Chaotic bat algorithm [J]. Journal of Computational Science, 2013, 5(2): 224-232.
FISTER I, FISTER D, YANG X S. A hybrid bat algorithm [J]. Electrotechnical Review, 2013, 80(1/2): 1-7.
GAO W F, LIU S Y. A modified artificial bee colony algorithm [J]. Computers and Operations Research, 2012, 39(3): 687-697.
CALHEIROS R N, RANJAN R, BELOGLAZOV A, et al. CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms [J]. Software Practice and Experience, 2011, 41(1): 23-50.
FEITELSON D G, DAN T, KRAKOV D. Experience with using the parallel workloads archive [J]. Journal of Parallel and Distributed Computing, 2014, 74(10): 2967-2982.