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ženo v:
Podrobná bibliografie
Vydáno v:2010 Third International Joint Conference on Computational Sciences and Optimization Ročník 2; s. 332 - 336
Hlavní autoři: Hui Li, Lifeng Wang, Jianhong Liu
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2010
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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