Task Scheduling of Computational Grid Based on Particle Swarm Algorithm

摘要：

The traditional scheduling theory can only get the approximate optimal solution of the problem, and most is to consider algorithms on a single task or independent multitask scheduling. It presents a particle swarm algorithm to solve the task scheduling problem of computational grid. It builds a task scheduling model of computational grid, changes the particle swarm algorithm in continuous space searching to an integer space searching, selects the appropriate inertia weight value, and enhances the searching capabilities of the algorithm. Through comparison with genetic algorithm, hybrid algorithm, and ant algorithm, the results show that the grid task scheduling algorithm has some advantages.

关键词： particle swarm computational grid task scheduling scheduling model

作者: Hui Li Lifeng Wang Jianhong Liu

作者单位: College of Communication and Electronic Engineering,Qiqihar University,Qiqihar Heilongjiang 161006,C College of Mechanical and Electrical Engineering,Northeast Forestry University,Harbin Heilongjiang 1 College of Chemistry and Chemical Engineering Qiqihar University Qiqihar Heilongjiang 161006,China

会议类型: 国际会议

会议名称: The Third International Joint Conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)

会议地点: 黄山

会议语种:英文

页码: 332-336

在线出版日期: 2010-05-28（万方平台首次上网日期，不代表论文的发表时间）