Load balancing task scheduling based on variants of genetic algorithms: Review paper

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the cloud platform, basic aim of task scheduling based algorithm is to reduce the makespan of the task and to minimize the load on resources. Users are working on large amount and the resources to be used are not up to the requirements. So, to fulfill global performance, cloud computing is used. Stated problem has been improved up to some extent by variant of genetic algorithm like JLGA (Job Spanning Time and Load Balancing and GA) and MPGA. Therefore, here it reviewed variant of genetic algorithm and did comparison among them. Furthermore, this paper proposed HJLGA (Hybridization of good features of JLGA and MPGA) which uses min-min algorithm to initialize population and also brings the concept of hill climbing to find the best fitted value. HJLGA satisfied the requirements of load balancing, least cost and minimum makespan of nodes.

Cite

CITATION STYLE

APA

Harkawat, A., Kumari, S., Pharkya, P., & Garg, D. (2017). Load balancing task scheduling based on variants of genetic algorithms: Review paper. In Communications in Computer and Information Science (Vol. 750, pp. 318–325). Springer Verlag. https://doi.org/10.1007/978-981-10-6544-6_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free