Skip to Main Content
ASME Press Select Proceedings

International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)

Editor
V. E. Muhin
V. E. Muhin
National Technical University of Ukraine
Search for other works by this author on:
W. B. Hu
W. B. Hu
Wuhan University
Search for other works by this author on:
ISBN:
9780791859742
No. of Pages:
656
Publisher:
ASME Press
Publication date:
2011

By analysis of dynamic and static two kinds of scheduling algorithm based on the Grid, We proposed a heuristic scheduling algorithm based on QoS objective function. In this paper, we decompose the task transmission time and task execution time, which decide by three factors: the network transmission speed, the load size and the processing ability of Grid. We defined the matching degree between task and the computation node. In QoS objective function P, we considered the two factors which are task complete time and matching degree, then given them different weights. Through constant iteration, finally, algorithm reached an optimal solution. The later experiment proved that the algorithm both to be able to guarantee the load equalization and satisfy the dynamic Grid environment, but the task complete time is little different than the Min-min algorithm.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal