By Topic

A Scheduling Algorithm Based on Task Complexity Estimating for Many-Task Computing

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

5 Author(s)
Yingnan Li ; Sch. of Electron. Eng. & Comput. Sci., Peking Univ., Beijing, China ; Xianguo Wu ; Jian Xiao ; Yu Zhang
more authors

There is a very important class of applications which is named Many-Task Computing (MTC). For a lot of MTC applications, a large number of independent tasks which differ significantly on task complexities will be generated. This brings a great challenge for grids to achieve a high performance for such MTC applications. In this paper, we describe the TCE algorithm, a scheduling algorithm based on Task Complexity Estimating which reduces the overhead by applying task bundling. We also present a task complexity model for task complexity estimating in order that after task bundling loads among computing nodes can be well balanced. The TCE algorithm greatly exceeded the other scheduling algorithms involved in performance evaluation on speedup and efficiency, and it achieved a performance close to that in the ideal condition. It is demonstrated that by applying the TCE algorithm the overhead cost can be reduced significantly and that load balance can be well guaranteed, so that grids can achieve a high performance for MTC applications.

Published in:

Semantics Knowledge and Grid (SKG), 2010 Sixth International Conference on

Date of Conference:

1-3 Nov. 2010