Title :
An Improved PSO Algorithm and its Application to Grid Scheduling Problem
Author :
Bu Yan-ping ; Zhou Wei ; Yu Jin-shou
Author_Institution :
Res. Inst. of Autom., East China Univ. of Sci. & Technol., Shanghai, China
Abstract :
With the advent of the grid, task scheduling in heterogeneous environments becomes more and more important. The model of grid scheduling is analyzed in this paper. The optimal objective is to minimize the total completing time. This paper presents an improved particle swarm optimization (PSO) algorithm with discrete coding rule for grid scheduling problem. The improved PSO algorithm can keep all the advantages of the standard PSO, such as implementation simplicity, low computational burden, and few control parameters, etc. A set of experiments show that the algorithm is stable and presents low variability. The preliminary results obtained in this research are auspicious. We also tested the improved PSO algorithm against the MaxMin heuristic and found that improved PSO outperforms MaxMin by the total makespan and other performance.
Keywords :
grid computing; particle swarm optimisation; scheduling; task analysis; MaxMin heuristic; PSO algorithm; discrete coding rule; grid computing; grid scheduling problem; particle swarm optimization algorithm; task scheduling; Application software; Biological systems; Computer science; Distributed computing; Grid computing; High performance computing; Particle swarm optimization; Processor scheduling; Scheduling algorithm; Throughput; PSO algorithm; grid; makespan; task scheduling;
Conference_Titel :
Computer Science and Computational Technology, 2008. ISCSCT '08. International Symposium on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3746-7
DOI :
10.1109/ISCSCT.2008.93