[1]傅明 刘凯雄 肖静.一种用于网格的启发性智能调度策略[J].计算机技术与发展,2006,(11):119-121.
 FU Ming,LIU Kai-xiong,XIAO Jing.A Strategy of Heuristic Intelligent Scheduling Applied in Grid[J].,2006,(11):119-121.
点击复制

一种用于网格的启发性智能调度策略()
分享到:

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2006年11期
页码:
119-121
栏目:
智能、算法、系统工程
出版日期:
1900-01-01

文章信息/Info

Title:
A Strategy of Heuristic Intelligent Scheduling Applied in Grid
文章编号:
1673-629X(2006)11-0119-03
作者:
傅明1 刘凯雄1 肖静2
[1]长沙理工大学计算机与通信工程学院[2]华中师范大学计算机科学系
Author(s):
FU Ming LIU Kai-xiong XIAO Jing
[1]College of Computer and Communication Engineering, Changsha University of Science and Technology[2]Department of Computer Science, Central China Normal University
关键词:
任务调度信息素并行遗传算法多群蚂蚁算法负载平衡
Keywords:
job sehedulingpheromoneparallel genetic algorithmmulti colony ant algorithm lead balancing
分类号:
TP301.6
文献标志码:
A
摘要:
任务调度是计算网格系统中极其关键的一部分,一种好的调度方法可以极大地提高整个系统的性能。针对蚂蚁算法在网格调度中早期信息素匮乏和蚂蚁分工单一的缺陷,提出了一种新的启发性智能调度方法。在调度过程前期,采用遗传算法为各网格节点生成丰富的信息素,作为调度中心进行任务调度的依据,然后在多群蚂蚁算法中,各种群的蚂蚁根据分工的不同在属于自己的空间中寻找最优解,从而缩小了搜索规模,加快了收敛速度,优化了调度性能
Abstract:
Job ,scheduling is a key part in the computing grid system, a good scheduling method could enhance the performance of entire system. In this paper, a new heuristic intelligent scheduling method is proposed, which could solve the drawback of ant algorithm's pheromone lack when applied in job seheduling in the early stage and all ants carry our the .same task. At the beginning of job scheduling, create abundant pheromones for each network- node by using genetic algorithm. And the scheduling center performs job scheduling depending on these pheromones. Because of dividing the work, each colony's ant has different task, and they search for the most optimun sohtuion from the multi colony ant algorithm. As a rest,It, it reduces the range during do the searching job and accelerates the convergent speed. In other words, it optimizes the capability of job scheduling

相似文献/References:

[1]易侃 王汝传.一种基于SOA的网格任务调度框架[J].计算机技术与发展,2010,(04):155.
 YI Kan,WANG Ru-chuan.A Task Scheduling Framework Based on SOA in Grid Computing[J].,2010,(11):155.
[2]郭创 余谅.网格任务调度算法的研究[J].计算机技术与发展,2009,(06):5.
 GUO Chuang,YU Liang.Research on Algorithm for Tasks Scheduling in Grid[J].,2009,(11):5.
[3]王爱平 朱永俊 张功营 刘芳.基于蚁群算法的呼叫中心人力资源分配[J].计算机技术与发展,2009,(03):204.
 WANG Ai-ping,ZHU Yong-jun,ZHANG Gong-ying,et al.Call Center Labor Resources Allocation Based on Ant Colony Algorithm[J].,2009,(11):204.
[4]张辉宜 赵海军 周秀丽.基于Pfair的分布式实时调度策略Linux下实现[J].计算机技术与发展,2008,(02):31.
 ZHANG Hui-yi,ZHAO Hai-jun,ZHOU Xiu-li.Based on Pfair Implementing Distributed Real- Time Scheduling in Linux Kernel[J].,2008,(11):31.
[5]樊晓香.任务调度问题机制设计[J].计算机技术与发展,2008,(07):119.
 FAN Xiao-xiang.Research of Task Scheduling in Mechanism Design[J].,2008,(11):119.
[6]赵健.基于GridSim的A-MM调度算法模拟[J].计算机技术与发展,2008,(10):96.
 ZHAO Jian.A- MM Algorithm Simulation Based on GridSim[J].,2008,(11):96.
[7]韩咚 陈波.基于时间Petri网的多处理机的调度算法[J].计算机技术与发展,2007,(06):15.
 HAN Dong,CHEN Bo.Algorithm of Multiprocessor Scheduling Based on Time Petri Nets[J].,2007,(11):15.
[8]张云锋 李胜磊 王炳波 华庆一[] 郝克刚[].基于Web的网格入口软件研究与实现[J].计算机技术与发展,2007,(07):53.
 ZHANG Yun-feng,LI Sheng-lei,WANG Bing-bo,et al.Research and Implementation of Web- Based Grid Portal[J].,2007,(11):53.
[9]聂雄.基于μClinux的嵌入式系统任务管理的研究[J].计算机技术与发展,2007,(04):158.
 NIE Xiong.Study of Embedded System Task Management on μClinux[J].,2007,(11):158.
[10]吕桦 钟诚 李智.一种基于任务复制方法的网格调度算法[J].计算机技术与发展,2006,(08):66.
 LU Hua,ZHONG Chenga,LI Zhi.A New Grid Scheduling Algorithm Based on Task Replication[J].,2006,(11):66.

备注/Memo

备注/Memo:
傅明(1961-),男,湖南长沙人,教授,博士后,硕士研究生导师.从事网格计算、基于网络的应用和数据挖掘等研究
更新日期/Last Update: 1900-01-01