期刊文献+

云计算任务调度的混合遗传蚁群算法研究

Research on Cloud Computing Task Scheduling Based on Hybrid Genetic Ant Algorithm
下载PDF
导出
摘要 针对云计算任务调度效率与负载均衡问题,提出一种基于混合蚁群遗传算法的任务调度方法。该算法通过分析云计算任务调度特点,以最小任务调度完成时间为优化目标,通过任务分组、重新设计变异算子和信息素挥发系数,实现任务到资源调度的完成时间最小。通过CloudSim平台仿真,并与Max-Min、Min-Min、GA和AIGA算法对比,结果表明,所提出的算法有效缩短了任务调度的完成时间,降低了运营成本,具有优越的综合性能。 Aiming at the efficiency and loadbalance of cloud computing task scheduling,a task scheduling method based on hybrid genetic ant algorithm is proposed.The algorithm analyzes the characteristics of cloud computing task scheduling,takes the minimum task scheduling completion time as the optimization goal,and achieves the minimum completion time from tasks to resource scheduling through task grouping,redesigning mutation operators and pheromone volatility coefficients.And compared with Max-Min,Min-Min,GA and AIGA algorithms.The simulation results show that the proposed algorithm effectively shortens the completion time of task scheduling,reduces operating costs,and has excellent comprehensive performance.
作者 任小强 王浩宇 林慧琼 赵超 REN Xiao-qiang;WANG Hao-yu;LIN Hui-qiong;ZHAO chao(Southwest Jiaotong University Hope College,Chengdu 610400,China)
出处 《唐山师范学院学报》 2023年第3期70-74,共5页 Journal of Tangshan Normal University
基金 教育部产学合作协同育人教学内容和课程体系改革项目(202102041003) 成都市交通+旅游大数据应用技术研究项目(2022117) 西南交通大学希望学院一流本科课程建设项目(2112056) 西南交通大学希望学院课程思政建设项目(KCSZ2023028) 2022年教育部供需对接就业育人项目(20230104390,0230106769)。
关键词 混合蚁群遗传算法 任务调度 云计算 运营成本 hybrid genetic ant algorithm task scheduling cloud computing data center cost
  • 相关文献

参考文献6

二级参考文献46

  • 1Linde Y, Buzo A, Gray RM. An algorithm for vector quantizer design [J]. IEEE Transaction on Communications, 1980, 28 (1): 84-95.
  • 2Kirpatrick S, Gelatt CD, Vecchi MP. Optimization by simulated annealing [J]. Science, 1983, 220(4598): 671-680.
  • 3Pan SM, Cheng KS. An evolution-based tabu search approach to codebook design [J]. Pattern Recognition, 2007, 40(2): 476-491.
  • 4Laskaris NA, Fotopoulos S. A novel training scheme for neural-network-based vector quantizers and its application in image compression [J]. Neurocomputing, 2004, 61: 421-427.
  • 5Kuo R J, Wang HS, Hu TL, et al. Application of ant K-means on clustering analysis [J]. Computers & Mathematics with Applications, 2005, 50(10-12): 1709-1724.
  • 6Eberhart R, Kennedy J. A new optimizer using particles swarm theory [C]. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, Oct. 4-6, 1995. [S. l.]: IEEE, 1995: 39-43.
  • 7Irani R, Nasimi R. Application of artificial bee colony-based neural network in bottom hole pressure prediction in underbalanced drilling [J]. Journal of Petroleum Science and Engineering, 2011, 78(1): 6- 12.
  • 8Akay B, Karaboga D. A modified artificial bee colony algorithm for real-parameter optimization [J]. Information Sciences, 2012, 192(1): 120-142.
  • 9Gao WF, Liu SY, Jiang F. An improved artificial bee colony algorithm for directing orbits of chaotic systems [J]. Applied Mathematics and Computation, 2011,218(7): 3868-3879.
  • 10Najkar N, Razzazi F, Sameti H. A novel approach to HMM-based speech recognition systems using particle swarm optimization [J]. Mathematical and Computer Modelling, 2010, 52(11-12): 1910-1920.

共引文献100

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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