首页 | 本学科首页   官方微博 | 高级检索  
     

基于动态粒子群优化的网格任务调度算法*
引用本文:刘波涛,刘金广.基于动态粒子群优化的网格任务调度算法*[J].计算机应用研究,2011,28(3):938-940.
作者姓名:刘波涛  刘金广
作者单位:1. 湖南文理学院,计算机科学与技术学院,湖南,常德,415000
2. 黄淮学院,计算机科学系,河南,驻马店,463000
摘    要:提出了一种基于动态粒子群优化的网格任务调度算法。设计了网格任务调度问题的数学模型,给出了自适应变异的动态粒子群优化算法的框架,引入了自适应学习因子和自适应变异策略,从而使算法具有动态自适应性,能够较容易地跳出局部最优。实验结果表明,本文算法能有效地解决异构网格任务调度问题,具有较好的应用价值。

关 键 词:网格  任务调度  粒子群优化算法
收稿时间:9/3/2010 12:00:00 AM
修稿时间:2011/1/30 0:00:00

Novel scheduling algorithm based on dynamic particle swarm optimization
LIU Bo-tao,LIU Jin-guang.Novel scheduling algorithm based on dynamic particle swarm optimization[J].Application Research of Computers,2011,28(3):938-940.
Authors:LIU Bo-tao  LIU Jin-guang
Affiliation:(1. College of Computer Science & Technology, Hunan University of Arts & Science, Changde Hunan 415000, China; 2. Dept. of Computer Science, Huanghuai University, Zhumadian Henan 463000, China)
Abstract:A novel grid task scheduling solution based on dynamic particle swarm optimization algorithm was proposed. The mathematical model of grid task scheduling problem was expound, the framework of dynamic particle swarm optimization algorithm was given, the adaptive learning factors and the adaptive mutation strategy were introduced to make proposed algorithm easily jump out of local optimum with effective dynamic adaptability. Experimental result shows that proposed algorithm can solve the scheduling problem of heterogeneous grid meta-task ,and has the advantage of good application value.
Keywords:grid  task schedule  particle swarm optimization algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号