期刊文献+

基于强化蚁群算法的任务DAG在线网格集群资源调度 被引量:3

On-line Grid Cluster Resource Scheduling Based on Task DAG and Reinforcement Ant Colony Algorithm
下载PDF
导出
摘要 网格集群资源调度是一个NP难题,而现有的调度方法通常具有任务调度效率低和负载不均衡的问题,由此设计了一种基于强化学习算法和蚁群算法融合的协同依赖型任务调度方法;首先对基于DAG的网格集群协同调度数学模型进行了定义,然后,采用改进的一步TD算法即Q-Learning算法实现集群资源的初始分配,从而得到最优调度方案以及对应的Q值,在此基础上提出一种改进的蚁群算法实现网格集群资源到任务分配的进一步优化,将Q-Learning算法得到的分配方案的Q值用于初始化蚁群路径中的信息素,以避免蚁群的盲目搜索,同时将Q值引入路径概率函数中使得蚂蚁具有启发式的搜索能力,从而获得协同依赖多任务集群调度的最终方案;在Gridsim环境下进行仿真试验,结果表明文中方法能有效地实现网格集群调度,且较其它方法具有任务调度效率高、CPU利用率高和负载均衡的优点,具有较大的优越性。 Grid cluster resource scheduling is a NP problem,the given grid cluster resource scheduling method has the long scheduling time and unbalance system load,a cooperative dependent task scheduling method based on reinforcement learning and parallel ant colony algorithm is proposed.Firstly,the scheduling goal model based on DAG model is defined,then the improved one step TD algorithm such as Qlearning is used to allocate the task resource,and saving the Q value of scheduling schema.Then an improved ant colony algorithm is introduce to realize the allocation of task to the resource node.The Q value obtained from the Q-learning algorithm is used to initialize the pheromone of the route to avoid the search of the ant in ant colony.The Q value is also considered into the probability function to make it has the heuristic ability.The experiment is operated in the Gridsim environment,the result shows the method in this paper can realize the cooperative dependent task cluster scheduling,and compared with the other methods,it has the less task scheduling time and high load balance level,therefore,it is a feasible scheduling method suitable for grid environment with big priority.
出处 《计算机测量与控制》 2015年第1期287-290,共4页 Computer Measurement &Control
基金 内蒙古自然科学基金(2014MS0618)
关键词 Q学习 集群调度 资源分配 蚁群算法 Q learning cluster scheduling resource allocation ant colony algorithm
  • 相关文献

参考文献11

  • 1Chervenak A, Fosterc I, Kesselman C, et al. The data grid: To- wards an architecture for the distributed management and analysis of largeseientifie datasets I-J]. Journal of Network and Computer Ap- plications, 2000, 23 (3): 187-200.
  • 2李明楚,许雷,孙伟峰,陆坤,郭成.基于非完全信息博弈的网格资源分配模型[J].软件学报,2012,23(2):428-438. 被引量:16
  • 3Kwok Y K, Song S S, Hwang K. Selfish grid computing: Game- theoretic modeling and NAS performance results A. In: Proc. of theIEEE Int I Symp. on Cluster Computing and the Grid EC. Washington: IEEE Computer Society Press, 2005:1143 - 1150.
  • 4Li J Y, Qiu M K, Ming Z, et al. Online optimization for schedu- ling preemptable tasks on IaaS cloud systems [J]. Journal of Paral lel and Distributed Computing, 2012, 72 (2) : 666 -677.
  • 5刘媛,马晓雷,刘元安,李保罡.基于含虚拟卖家组合双向拍卖的网格资源管理[J].吉林大学学报(工学版),2012,42(5):1302-1308. 被引量:2
  • 6Kamalam G K, Murali Bhaskaran V. New enhanced heuristic min mean scheduling algorithm for scheduling meta-tasks on heterogene- ous grid environment [J]. European Journal of Scientific Research, 2012, 70 (3) 423-430.
  • 7Braun T D, Siegel H J, Beck N. A comparison of eleven static heu- ristics for mapping a class of independent tasks onto heterogeneous distributed computing systems rJ. Journal of Parallel and distribu ted computing, 2001, 61 (6): 810-837.
  • 8Moreno R J. Scheduling and resource management techniques in dynam- ics grid environment [-A. The 8th Int 1 Conf on Advanced computing and communications (ADCOM 2000) [-C. Cochin, 2000.
  • 9穆瑞辉,苗国义.基于QoS约束的启发式网格资源分配算法研究[J].计算机测量与控制,2012,20(12):3357-3360. 被引量:2
  • 10张忠平,温利娟.OPT-Min-Min:基于Min-Min网格资源调度算法的优化[J].小型微型计算机系统,2014,35(7):1573-1577. 被引量:13

二级参考文献50

共引文献36

同被引文献12

引证文献3

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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