Hybrid genetic, variable neighbourhood search and particle swarm optimisation-based job scheduling for cloud computing Online publication date: Thu, 27-Sep-2018
by Rachhpal Singh
International Journal of Computational Science and Engineering (IJCSE), Vol. 17, No. 2, 2018
Abstract: In cloud computing environment (CCE), many scheduling mechanisms have been proposed so far to balance the load between the given set of distributed servers. Genetic algorithm (GA) has been verified to be the best technique to reduce energy consumed by distributed servers, but it becomes unsuccessful to strengthen the exploration in the rising areas. The performance of particle swarm optimisation (PSO) depends upon initially selected random particles, i.e., wrongly selected particles may produce poor results. The variable neighbourhood search (VNS) can be used to set stability of non-local searching and local utilisation for an evolutionary processing period. Therefore, this paper proposes a hybrid of VNS, GA and PSO called HGVP in order to overcome the constraint of poorly selected initial amount of particles in case of PSO-based scheduling for CCE. The simulation of the proposed technique has shown effective results over the available techniques especially in terms of energy consumption.
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 Computational Science and Engineering (IJCSE):
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