By Topic

A heuristic scheduling strategy for independent tasks on grid

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhang Jinquan ; Dept. of Comput. Sci., Tongji Univ., Shanghai, China ; N. Lina ; Jiang Changjun

Task scheduling is an NP-complete problem and is an integral part of parallel and distributed computing. It is more complicated under the grid computing environment. In this paper, we consider the problem of allocating independent, heterogeneous tasks on grid environment. A heuristic task scheduling strategy which is composed of two algorithms satisfied with resource load balance is presented. The WMTG-min heuristic algorithm schedules tasks by employing the weighted mean execution time, which reflects the performance of overall machines, and it is a high efficient algorithm. The further optimal scheduling result of the above algorithm is gained by the WMTSG-min algorithm which employs the weighted mean execution time and sufferage value as heuristic information. The performance of the proposed algorithms is evaluated via extensive simulation experiments. Experiment results show that the heuristic strategy performs significantly to ensure high throughput. Furthermore, results show that although it may not be polynomial, the WMTSG-min algorithm is efficient

Published in:

Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05)

Date of Conference:

1-1 July 2005