By Topic

Dynamic scheduling methods for computational grid environments

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
$31 $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)
Sheng-De Wang ; Dept. of Electr. Eng., National Taiwan Univ., Taipei, Taiwan ; I-Tar Hsu ; Zheng-Yi Huang

In this paper, we propose an adaptive and dynamic scheduling method, called most fit task first (MFTF), for a class of computational grids, which are characterized by heterogeneous computing nodes and dynamic task arrivals. Some existing static scheduling methods assume that tasks arrive statically and may not perform well in the case of dynamic task arrivals. Our method can get stable task execution times whether tasks arrive statically or dynamically. We compare the task execution time with other methods to show the performance of the scheduling method.

Published in:

Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on  (Volume:1 )

Date of Conference:

20-22 July 2005