Task scheduling by Mean Field Annealing algorithm in grid computing

Desirable goals for grid task scheduling algorithms would shorten average delay, maximize system utilization and fulfill user constraints. In this work, an agent-based grid management infrastructure coupled with mean field annealing (MFA) scheduling algorithm has been proposed. An agent in grid util...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) s. 783 - 787
Hlavní autoři: Guixiang Xue, Zheng Zhao, Maode Ma, Tonghua Su, Tianwen Zhang, Shuang Liu
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2008
Témata:
Artificial neural networks
Delay
Equations
Neurons
Processor scheduling
Scheduling
Scheduling algorithm
ISBN:1424418224, 9781424418220
ISSN:1089-778X
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í:Desirable goals for grid task scheduling algorithms would shorten average delay, maximize system utilization and fulfill user constraints. In this work, an agent-based grid management infrastructure coupled with mean field annealing (MFA) scheduling algorithm has been proposed. An agent in grid utilizes a neural network algorithm to manage and schedule tasks. The Hopfield neural network is good at finding optimal solution with multi-constraints and can be fast to converge to the result. However, it is often trapped in a local minimum. Stochastic simulated annealing algorithm has an advantage in finding the optimal solution and escaping from the local minimum. Both significant characteristics of Hopfield neural network structure and stochastic simulated annealing algorithm are combined together to yield a mean field annealing scheme. A modified cooling procedure to accelerate reaching equilibrium for normalized mean field annealing has been applied to this scheme. The simulation results show that the scheduling algorithm of MFA works effectively.
ISBN:1424418224
9781424418220
ISSN:1089-778X
DOI:10.1109/CEC.2008.4630885