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

基于模糊粒子群优化的计算网格工作调度算法
引用本文:王秀坤,程文树,刘洪波.基于模糊粒子群优化的计算网格工作调度算法[J].计算机科学,2007,34(11):64-66.
作者姓名:王秀坤  程文树  刘洪波
作者单位:大连理工大学计算机科学与工程系,大连,116023
基金项目:国家重点基础研究发展计划(973计划)
摘    要:网格计算是利用网络把分散的计算资源组织起来解决复杂问题的计算模式,工作调度是待解决的主要问题之一。本文提出一种基于模糊粒子群优化的网格计算工作调度算法,该算法利用模糊粒子群优化动态地产生网格计算工作调度的优化方案,使现有计算资源完成所有工作的时间最小化。实验结果表明,与基于遗传算法、模拟退火、蚁群算法的工作调度方法相比,所提出的算法在时间和精度上具有一定的优势。

关 键 词:网格计算  粒子群优化  遗传算法  退火算法  蚁群算法

Job Scheduling on Computational Grids Using Fuzzy Particle Swarm Optimization
WANG Xiu-Kun,CHENG Wen-Shu,LIU Hong-Bo.Job Scheduling on Computational Grids Using Fuzzy Particle Swarm Optimization[J].Computer Science,2007,34(11):64-66.
Authors:WANG Xiu-Kun  CHENG Wen-Shu  LIU Hong-Bo
Affiliation:WANG Xiu-Kun,CHENG Wen-Shu,LIU Hong-Bo (Department of Computer Science and Engineering,Dalian University of Technology,Dalian
Abstract:Computational Grids are the computing framework to meet the growing computational demands, which re-organizes the resources of many computers in the networks to solve a large of complex problems. Essential grid services contain intelli- gent functional mechanism for discovery, publishing of resources as well as scheduling, submission and monitoring of jobs. The paper introduces a novel approach based on fuzzy Particle Swarm Optimization (PSO) for scheduling jobs on computational grids. Our approach is to dynamically generate an optimal schedule so as to complete the tasks in a minimum period of time as well as utilizing the resources in an efficient way. We evaluate the performance of our proposed approach with a direct Genetic Algorithm (GA), Simulated Annealing (SA) and Ant Colony Algorithm (ACO) approach. The results illustrated the poten- this of our approach, especially on the balance between time and precision.
Keywords:Grid computing  PSO  GA  SA  ACO
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》浏览原始摘要信息
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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