By Topic

An algorithm for jobs scheduling in computational grid based on time-balancing strategy

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

5 Author(s)
Yan-Li Hu ; Sch. of Inf. Syst. & Manage., National Univ. of Defense Technol., Changsha, China ; Bao-Xin Xiu ; Wei-Ming Zhang ; Wei-Dong Xiao
more authors

The computational grid provides a promising platform for the efficient execution of parallel coarse grain tasks computing over very large sample space. Scheduling such applications is challenging for the heterogeneity, autonomy, and dynamic adaptability of grid resources. Assuming resource owners have a preemptive priority, we propose an adaptive algorithm of jobs scheduling based on time balancing strategy, which solves the parallel computing tasks by using the idle resources in computational grid. A mathematical model is developed to predict performance, which also considers systems with heterogeneous machine utilization and heterogeneous service distribution. The model separates the influence of machine utilization, job service rate and parallel task allocation on the completion time. According to the time balancing policy, a task is partitioned into several subtasks and scheduled, and the costs of communication are reduced. The expected value of parallel task completion time is predicted with performance model. To get better parallel computing performance, an optimal subset of heterogeneous resources with the shortest parallel executing time of tasks can be selected with the efficient algorithm. Remapping strategy is applied during scheduling, which is more suitable for the dynamic adaptability and domain autonomy in the grid.

Published in:

2005 International Conference on Machine Learning and Cybernetics  (Volume:5 )

Date of Conference:

18-21 Aug. 2005