| A Hybrid Task Scheduling Algorithm in Grid |
| |
| 引用本文： | 张艳梅 曹怀虎 余镇危. A Hybrid Task Scheduling Algorithm in Grid[J]. 东华大学学报(英文版), 2006, 23(6): 84-86,92 |
| |
| 作者姓名： | 张艳梅 曹怀虎 余镇危 |
| |
| 作者单位： | [1]Information School, Central University of Finance and Economics, Beijing 100081 [2]Computer Department ,China University of Mining and Technology （Beijing）, Beijing 100083 |
| |
| 基金项目： | 教育部高等学校博士学科点专项科研基金 |
| |
| 摘 要： | Task scheduling in Grid has been proved to be NP- complete problem. In this paper, to solve this problem, a Hybrid Task Scheduling Algorithm in Grid （HTS） has been presented, which joint the advantages of Ant Colony and Genetic Algorithm.Compared with the related work, the result shows that the HTS algorithm significantly surpasses the previous approaches in schedule length ratio and speedup.
|
| 关 键 词： | 网格 信息技术 信息处理 任务分配 |
| 收稿时间： | 2006-08-20 |
| 修稿时间： | 2006-08-20 |
A Hybrid Task Scheduling Algorithm in Grid |
| |
| ZHANG Yan-mei,CAO Huai-hu,YU Zhen-wei. A Hybrid Task Scheduling Algorithm in Grid[J]. Journal of Donghua University, 2006, 23(6): 84-86,92 |
| |
| Authors: | ZHANG Yan-mei CAO Huai-hu YU Zhen-wei |
| |
| Affiliation: | 1. Information School, Central University of Finance and Economics, Beijing 100081;Computer Department ,China University of Mining and Technology (Beijing), Beijing 100083
2. Computer Department ,China University of Mining and Technology (Beijing), Beijing 100083 |
| |
| Abstract: | Task scheduling in Grid has been proved to be NP-complete problem. In this paper, to solve this problem, a Hybrid Task Scheduling Algorithm in Grid (HTS) has been presented, which joint the advantages of Ant Colony and Genetic Algorithm. Compared with the related work, the result shows that the HTS algorithm significantly surpasses the previous approaches in schedule length ratio and speedup. |
| |
| Keywords: | task graph Genetic Algorithm Ant Colony task scheduling heterogeneous system |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
