一种改进的PSO网格调度算法  

A grid scheduling algorithm under the improved PSO

作　　者：杨长兴[1] 胡金[1] 

机构地区：[1]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《微型机与应用》2011年第12期85-88,共4页Microcomputer & Its Applications

摘　　要：提出了一种基于独立任务的改进PSO网格调度算法(MCPSO)。该算法结合粒子群优化算法和混沌机制,在保证寻优速度的同时又能兼顾"跳出"局部最优的能力。实验结果表明,与基本粒子群优化算法相比,该算法具有更好的收敛速度和求解质量。MCPSO,an improved PSO of grid task scheduling algorithm under the meta task model,is proposed for shortening the completion time of task scheduling and efficiently balancing the workload of grid resource in this paper.The algorithm combines PSO and the mechanism of Chaos optimization.It can ensure the optimum speed at the same time take into account the ability of getting away from the local optimum.The experimental results compared with basic PSO algorithm show that the proposed algorithm in this paper has good convergence speed and quality of solutions.

关 键 词：网格调度 独立任务 PSO 混沌优化 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]