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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2010 Third International Joint Conference on Computational Sciences and Optimization Ročník 2; s. 332 - 336
Hlavní autori: Hui Li, Lifeng Wang, Jianhong Liu
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.05.2010
Predmet:
Assembly
computational grid
Computational modeling
Costs
Educational institutions
Genetic algorithms
Grid computing
particle swarm
Particle swarm optimization
Processor scheduling
Resource management
Scheduling algorithm
scheduling model
task scheduling
ISBN:1424468124, 9781424468126
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISBN:1424468124
9781424468126
DOI:10.1109/CSO.2010.34