By Topic

Load balanced scheduling of independent tasks in heterogeneous computing systems

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)
Sruthi, R. ; Dept. of Comput. Sci. & Eng., Thiagarajar Coll. of Eng., Madurai, India ; Chitra, P. ; Poorna, R. ; Karpagalakshmi, R.
more authors

The heterogeneous distributed computing system consists of network of heterogeneous computers and the applications to execute on it. The applications may have different deadline criteria. Based on the nature of the deadline, the applications are categorised as mission-critical, firm and soft. In this paper, a load balanced algorithm is proposed for non-pre-emptively scheduling a bag of independent tasks in a heterogeneous computing environment. The load of a machine is the sum of execution times of tasks that are currently scheduled in it. This scheduler has three major goals i)To maximize the number of mission-critical tasks meeting their deadline ii)To maximize the total number of tasks meeting their deadline iii) To achieve a load balance on all the machines by minimising the load difference. The algorithm is compared for various performance metrics, with the other algorithms in the literature and proves to be better.

Published in:

Recent Trends in Information Technology (ICRTIT), 2011 International Conference on

Date of Conference:

3-5 June 2011