A Hybrid Task Scheduling Algorithm in Grid
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.
作 者： ZHANG Yan-mei CAO Huai-hu YU Zhen-wei 作者单位： ZHANG Yan-mei,CAO Huai-hu(Information School, Central University of Finance and Economics, Beijing 100081;Computer Department ,China University of Mining and Technology (Beijing), Beijing 100083)YU Zhen-wei(Computer Department ,China University of Mining and Technology (Beijing), Beijing 100083)
刊 名： 东华大学学报（英文版） EI 英文刊名： JOURNAL OF DONGHUA UNIVERSITY(ENGLISH EDITION) 年，卷(期)： 2006 23(6) 分类号： O1 关键词： task graph Genetic Algorithm Ant Colony task scheduling heterogeneous system