计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (26): 105-107.DOI: 10.3778/j.issn.1002-8331.2008.26.032

• 网络、通信、安全 • 上一篇    下一篇

网格计算中基于并行克隆遗传算法的任务分配与调度

马景奕1,2,舒万能3,屈玉贵1   

  1. 1.中国科学技术大学 信息科学技术学院,合肥 230027
    2.甘肃省气象培训中心,兰州 730020
    3.中南民族大学 计算机科学学院,武汉 430074
  • 收稿日期:2007-11-07 修回日期:2008-03-19 出版日期:2008-09-11 发布日期:2008-09-11
  • 通讯作者: 马景奕

Tasks matching and scheduling of grid computing using parallel clone genetic algorithm

MA Jing-yi1,2,SHU Wan-neng3,QU Yu-gui1   

  1. 1.School of Information Science and Technology,University of Science and Technology of China,Hefei 230027,China
    2.Gansu Province Meteorological Bureau Training Center,Lanzhou 730020,China
    3.College of Computer Science,South-Central University for Nationalities,Wuhan 430074,China
  • Received:2007-11-07 Revised:2008-03-19 Online:2008-09-11 Published:2008-09-11
  • Contact: MA Jing-yi

摘要: 实现网格计算的一个重要目的在于实现地理分布、异构资源的统一描述方法,提供用户虚拟的统一资源界面,并将用户提出的服务要求透明、动态地分配给最适应的资源上执行。针对目前任务调度的应用现状,提出了一种既能使资源负载均衡又能充分利用系统资源的并行克隆遗传算法,该启发式算法能显著地降低资源最优分配中的计算复杂度,使其能满足实时调度的需要。实验结果表明这种算法优于其他调度算法。

Abstract: An important aspect in implementing grid computing is the implement of unified description method for the geographically distributed,heterogeneous resource,so that the grid system can give users the virtual unified resource interface and execute the task scheduling by the users on the fittest resource node dynamically.Aiming at the conditions and characteristic of application of task scheduling,a parallel clone genetic algorithm is introduced.Application of the algorithm dramatically reduces the computing complexity in resource allocating meeting the requests of real time schedule.From the experiment result,it concludes that this algorithm is superior to other algorithm.