Load balanced scheduling of independent tasks in heterogeneous computing systems Online publication date: Sat, 16-Aug-2014
by P. Chitra; R. Sruthi
International Journal of Information Technology, Communications and Convergence (IJITCC), Vol. 2, No. 2, 2012
Abstract: In real world, applications with different deadline criteria exist. 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 with different priorities and deadlines on a heterogeneous computing system (HCS). Given the execution times of tasks, the load on the machine is the sum of these times for the tasks that are currently scheduled on the machine. The major goals of the proposed scheduler are to maximise the number of mission-critical tasks meeting their deadline, to maximise the total number of tasks meeting their deadline and to achieve a load balance on all the machines by minimising the load difference factor. The proposed scheduler is compared with the other algorithms available in the literature and proved to give significantly better performance.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Technology, Communications and Convergence (IJITCC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook