期刊文献+

基于蚁群算法的Storm集群资源感知任务调度 被引量:3

Research on Storm Resource-aware Task Scheduling with Ant Colony Algorithm
下载PDF
导出
摘要 实时计算系统Storm是当前十分流行的开源流式系统,在处理流式数据时具有明显的优势,但也存在默认调度器在任务调度时难以将节点资源与任务需求相结合、节点资源利用率不高、节点内存不足以及网络堵塞等问题。为了解决这些问题,提出了一种基于蚁群算法的Storm集群资源感知任务调度算法及其实现方案。该算法将节点的资源动态变化表示为蚂蚁运动所需的信息素,将任务调度过程模拟为蚂蚁觅食过程,以此对任务调度进行优化,保证了Storm任务调度的有效性。实验结果表明,该算法能够找到与当前任务所需资源最匹配的节点,从而实现资源的合理分配;与默认调度相比,具有更优的任务调度效率、更少的平均处理时间和更高的集群吞吐量,有利于集群负载均衡,优化集群的性能。 Storm is the popular open source real-time computing system, which has a great advantage in handling data stream. However, there are some problems in its default scheduler when scheduling tasks, such as difficultly in combining node resources and mission re- quirements, ineffectiveness in node resource utilization, lack of memory and network congestion and so on. In order to solve them, a re- source-aware scheduler based on ant colony algorithm and its implementation scheme is proposed, in which the dynamic changes of the node resource can be expressed as the pheromones of ant movement required and the task scheduling process is similar to ant foraging process, to optimize the task scheduling and ensure the effectiveness of the Storm task scheduling. Experimental results show that it has found the most suitable node for the current task and achieved the reasonable allocation of resources and that compared with the default scheduling, it has better task scheduling efficiency, less average processing time and higher throughput of the cluster, which can benefit the load balance and optimize the performance for the cluster.
出处 《计算机技术与发展》 2017年第9期92-96,100,共6页 Computer Technology and Development
基金 国家自然科学基金资助项目(61572260) 江苏省科技支撑计划项目(BE2015702)
关键词 STORM 资源感知 蚁群算法 负载均衡 Storm resource-aware ant colony algorithm load balance
  • 相关文献

参考文献2

二级参考文献17

  • 1汪向利,王万良,徐新黎.基于自适应蚁群算法的Job-shop调度方法及其仿真研究[J].系统仿真技术,2005,1(3):141-146. 被引量:6
  • 2杨阿莉.一种改进蚁群算法在车间作业调度问题中的研究与应用[J].机械与电子,2005,23(4):9-12. 被引量:8
  • 3陈知美,顾幸生.改进型蚁群算法在Job Shop问题中的应用[J].华东理工大学学报(自然科学版),2006,32(4):466-470. 被引量:10
  • 4K Ganeshan, D Janaki Ram. Distribute Simulated Annealing Algorithm for Job Shop Scheduling[ J ]. IEEE Transactions on Systems, Man, and Cybernetics, 1995,25(7) : 1102 -1109.
  • 5M Laguna, J W Barnes and F W Glover. Tabu search methods for a single machine scheduling problem [ J ]. Journal of Intelligent Manufacturing, 1991,2:63.
  • 6F D Croee, R Tadei, G Volta. A genetic Algorithm for the Job Shop Problem[ J]. Computer Ops. Res. , 1995,22 ( 1 ) : 15 - 24.
  • 7A Colomi, et al. Distributed optimization by ant colonies [ C ]. Proceedings of the 1st European Conference on Artificial Life, 1991. 134 - 142.
  • 8T Stiitzle, H Hoos. Max - min ant system and local search for combinatorial optimization problems[ M] . S Vo B, Martello S, I Osman H , et al ( Eds. ) Meta - Heuristics : advances and trends in local search paradigms for Optimization. Kluwer Academic, Boston, MA, 1999. 313-329.
  • 9Sims K.IBM introduces ready-to-use cloud computing collaboration services get clients started with cloud computing[EB/OL].2007:http://www-03.ibm.com/press/us/en/pressrelease/22613.wss.
  • 10Marco Dorigo,Thomas Stutzle.Ant Colony Optimization[M].Cambridge,Masschusetts London,England.MIT Press,2004.

共引文献8

同被引文献30

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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