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

基于量子蚁群算法的网格任务调度研究
引用本文:苏日娜,王宇.基于量子蚁群算法的网格任务调度研究[J].计算机工程与应用,2011,47(12):46-48.
作者姓名:苏日娜  王宇
作者单位:宁波工程学院,电子与信息工程学院,浙江,宁波,315016
基金项目:浙江省自然科学基金资助项目,浙江省教育厅基金项目
摘    要:任务调度策略是网格计算的核心问题。在系统任务调度和资源分配中,提出一种基于量子蚁群算法的任务调度策略。算法将量子计算与蚁群算法相融合,通过对蚁群进行量子化编码并采用量子旋转门及非门操作,实现对任务自适应启发式的分配和优化。算法有效增强了种群的多样性、克服了遗传算法和蚁群算法的早熟收敛和退化现象。仿真实验中,分别与基于遗传算法和基于蚁群算法的任务调度策略相对比,结果表明算法有效缩短了任务调度的时间跨度,增强了网格系统的性能。

关 键 词:量子蚁群算法  网格任务调度  遗传算法  蚁群算法
修稿时间: 

Research of grid task schedule based on quantum ant colony algorithm
SU Rina,WANG Yu.Research of grid task schedule based on quantum ant colony algorithm[J].Computer Engineering and Applications,2011,47(12):46-48.
Authors:SU Rina  WANG Yu
Affiliation:College of Electronic and Information Engineering,Ningbo University of Technology,Ningbo,Zhejiang 315016,China
Abstract:Task schedule strategy is the key issue of grid computing.During the schedule and allocation of the system tasks, task schedule strategy based on quantum ant colony algorithm is proposed.This algorithm combines quantum computing with the ant colony algorithm and achieves optimal task schedule by quantum coding and quantum evolution operator.It ensures the diversity of population and overcomes premature convergence and degradation of the genetic algorithm and ant colony algorithm.Compared with the genetic algorithm and ant colony algorithm task schedule strategy, simulations show that the search ability of this algorithm is better, and it can reduce the time span of the task schedule and enhance the performance of grid system effectively.
Keywords:quantum ant colony algorithm  grid task schedule  genetic algorithm  ant colony algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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