期刊文献+

采用改进二进制蝙蝠算法的任务调度算法 被引量:4

A Task Scheduling Algorithm Based on an Improved Binary Bat Algorithm
下载PDF
导出
摘要 针对海服务系统环境中任务完成时间过长的问题,提出一种基于改进二进制蝙蝠算法(IBBA)的任务调度算法。该算法通过在二进制蝙蝠算法(BBA)寻优过程中引入非线性惯性权重因子,平衡全局搜索和局部搜索能力;利用2个不同的邻居蝙蝠算子构成扰动项,避免算法陷入局部最优;利用自适应学习因子调整全局最优算子和邻居蝙蝠算子的权重,控制整个寻优过程由全局搜索为主向局部搜索为主过渡。实验结果表明:IBBA可以稳定地搜索到全局最优值,与现有的基于二进制粒子群算法(BPSO)和二进制蝙蝠算法的任务调度算法相比,在任务数较多时,基于IBBA的任务调度算法能避免过早收敛,使任务完成时间显著减少。在海服务网络中,将该算法应用于任务调度,可提高处理大粒度服务的效率。 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.
作者 黄兴旺 曾学文 郭志川 韩锐 HUANG Xingwang;ZENG Xuewen;GUO Zhichuan;HAN Rui(National Network New Media Engineering Research Center,Institute of Acoustics,Chinese Academy of Sciences, Beijing 100190, China;University of Chinese Academy of Sciences,Beijing 100049, China)
出处 《西安交通大学学报》 EI CAS CSCD 北大核心 2017年第10期65-70,共6页 Journal of Xi'an Jiaotong University
基金 国家高技术研究发展计划资助项目(2015AA015802)
关键词 任务调度 二进制蝙蝠算法 海服务 task scheduling binary bat algorithm sea service
  • 相关文献

参考文献5

二级参考文献39

  • 1王俊伟,汪定伟.粒子群算法中惯性权重的实验与分析[J].系统工程学报,2005,20(2):194-198. 被引量:86
  • 2胡小兵,黄席樾.基于蚁群优化算法的0-1背包问题求解[J].系统工程学报,2005,20(5):520-523. 被引量:24
  • 3孟伟,韩学东,洪炳镕.蜜蜂进化型遗传算法[J].电子学报,2006,34(7):1294-1300. 被引量:78
  • 4王会颖,贾瑞玉,章义刚,齐平.一种求解0-1背包问题的快速蚁群算法[J].计算机技术与发展,2007,17(1):104-107. 被引量:22
  • 5MALEWICZ G,AUSTERN M H,BIK A J,et al.Pregel:a system for large-scale graph processing[C]∥Proceedings of the2010ACM SIGMOD Interna-tional Conference on Management of Data.New York,USA:ACM,2010:135-146.
  • 6ARMBRUST M,FOX A,GIFFITH R,et al.Above the clouds:a Berkeley view of cloud computing[EB/OL].(2009-10-08)[2012-04-03].http:∥www.ee-cs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-28.html.
  • 7BUYYA R,YEO C S,VENUGOPAL S,et al.Cloud computing and emerging IT platforms:vision,hype,and reality for delivering computing as the5th utility[J].Future Generation Computer Systems,2009,25(6):599-616.
  • 8ULLMAN J K.NP-complete scheduling problems[J].Journal of Computer and Systems Sciences,1975,10(3):498-500.
  • 9TOPCUOGLU K,HARIRI S,WU M.Performance-effective and low-complexity task scheduling for heter-ogeneous computing[J].IEEE Transactions on Paral-lel and Distributed Systems,2002,13(3):260-274.
  • 10BOZDA D,ZGNER F,CATALYUREK R U.A task duplication based bottom-up scheduling algorithm for heterogeneous environments[C]∥Proceedings of the 20th International Parallel and Distributed Processing Symposium.Piscataway,NJ,USA:IEEE,2006:160-172.

共引文献207

同被引文献41

引证文献4

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部