Title: Hybrid genetic, variable neighbourhood search and particle swarm optimisation-based job scheduling for cloud computing

Authors: Rachhpal Singh

Addresses: Department of Computer Science, Guru Nanak Dev University, Amritsar, Punjab, India

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.

Keywords: cloud computing environment; CCE; job scheduling; particle swarm optimisation; PSO; makespan; HGVP; genetic algorithm; high end server; variable neighbourhood search; VNS; NP-hard.

DOI: 10.1504/IJCSE.2018.094928

International Journal of Computational Science and Engineering, 2018 Vol.17 No.2, pp.184 - 191

Received: 10 Feb 2016
Accepted: 21 May 2016
Published online: 27 Sep 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article