Modified genetic algorithm for multiobjective task scheduling on heterogeneous computing system Online publication date: Sat, 28-Feb-2015
by O.L. Sathappan, P. Chitra, P. Venkatesh, M. Prabhu
International Journal of Information Technology, Communications and Convergence (IJITCC), Vol. 1, No. 2, 2011
Abstract: This paper addresses the problem of task scheduling in heterogeneous distributed systems with the goal of maximising the system reliability and decreasing the makespan. The task scheduling problem in heterogeneous systems an NP-complete problem. A modified genetic algorithm which combines the characteristics of bacteriological algorithm (BA) and genetic algorithm is proposed. This modified algorithm (MA) is used in the weighted sum approach of multiobjective genetic algorithm (MOGA). The proposed algorithm is applied for random and real-time numerical application graphs and compared with the biobjective genetic algorithm (BGA) in the literature. The simulation results confirm that the proposed algorithm produces near optimal solutions at reduced computational times.
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