The Scheduling Algorithm of Grid Task Based on PSO and Cloud Model

Abstract:

Article Preview

Grid task scheduling (GTS) is a NP-hard problem. This paper proposes an optimized GTS algorithm which combines with the advantages of cloud model based on the particle swarm optimization algorithm. This algorithm iterates tasks utilizing the advantages of particle swarm optimization algorithm and then gets a set of candidate solutions quickly. In addition, this algorithm modifies the value of entropy and excess entropy using the characteristics of cloud model and implements the transformation between qualitative variables and quantity of uncertain events. And this algorithm makes particles fly to the global optimal solutions by exact searching in local areas. Theoretical analysis and simulation results show that this algorithm makes load balance of resource efficiently. It also avoids the problems of genetic algorithm and basic particle swarm optimization algorithm, which would easily fall into local optimal solutions and premature convergence caused by too much selected pressure. This algorithm has the advantages of high precision and faster convergence and can be applied in task scheduling on computing grid.

Info:

Periodical:

Key Engineering Materials (Volumes 439-440)

Edited by:

Yanwen Wu

Pages:

1487-1492

DOI:

10.4028/www.scientific.net/KEM.439-440.1487

Citation:

S. B. Zhong and Z. S. He, "The Scheduling Algorithm of Grid Task Based on PSO and Cloud Model", Key Engineering Materials, Vols. 439-440, pp. 1487-1492, 2010

Online since:

June 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.