loading...
A Heuristic Algorithm for Task Scheduling Based on Mean Load
Beijing, China November 27-November 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SKG.2005.13First International Conference on Sem ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lina Ni, Shandong University of Science & Technology, Qingdao, 266510, China
Jinquan Zhang, Shandong University of Science & Technology, Qingdao, 266510, China
Chungang Yan, Tongji University, Shanghai, 201804, China
Changjun Jiang, Tongji University, Shanghai, 201804, China
Efficient task scheduling is critical to achieving high performance on grid computing environment. A heuristic task scheduling algorithm satisfied resources load balancing on grid environment is presented in this paper. The algorithm schedules tasks by employing mean load based on task predictive execution time as heuristic information to obtain an initial scheduling strategy. Then an optimal scheduling strategy is achieved by selecting two machines satisfied condition to change their loads via reassigning their tasks under the heuristic of their mean load. Methods of selecting machines and tasks are given in this paper to increase the throughput of the system and reduce the total waiting time. The performance of the proposed algorithm is evaluated via extensive simulation experiments. Experiment results show that the heuristic algorithm performs significantly to ensure high load balancing and achieve an optimal scheduling strategy almost all the time. Furthermore, results show that our algorithm is high efficient in terms of time complexity.
Citation:
Lina Ni, Jinquan Zhang, Chungang Yan, Changjun Jiang, "A Heuristic Algorithm for Task Scheduling Based on Mean Load," skg, pp.5, First International Conference on Semantics, Knowledge and Grid (SKG'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.