loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Conference on Semantics, Knowledge and Grid (SKG'05)
A Chaotic Neural Network Algorithm for Task Scheduling in Overlay Grid
Beijing, China
November 27-November 29
ISBN: 0-7695-2534-2
Huaihu CAO, China University of Mining and Technology Beijing
Zhenwei YU, China University of Mining and Technology Beijing
Yinyan WANG, China University of Mining and Technology Beijing
Task scheduling is one key issue in computational overlay grid. For finding solution to this problem, we propose a Chaotic Neural Network Algorithm for Task Scheduling, the goal of this algorithm is to minimize the total execution time of task by appropriately mapping the task to processor in the parallel system. We formulate the task scheduling problem that considers heterogeneousness. To evaluate the effectiveness of this algorithm, we compare this algorithm with the simulated annealing, and the genetic algorithm etc. The average experimental result of the algorithm is obviously superior to other conventional algorithms.
Citation:
Huaihu CAO, Zhenwei YU, Yinyan WANG, "A Chaotic Neural Network Algorithm for Task Scheduling in Overlay Grid," skg, pp.38, First International Conference on Semantics, Knowledge and Grid (SKG'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.