Visible to the public Cloud Task Scheduling Based on Swarm Intelligence and Machine Learning

TitleCloud Task Scheduling Based on Swarm Intelligence and Machine Learning
Publication TypeConference Paper
Year of Publication2017
AuthorsRjoub, G., Bentahar, J.
Conference Name2017 IEEE 5th International Conference on Future Internet of Things and Cloud (FiCloud)
KeywordsAnt colony optimization, approximation techniques, cloud computing, cloud environment, cloud environments, Cloud task scheduling, CloudSim, CloudSim toolkit package, composability, computational complexity, distributed computing, execution time minimization, Honey Bee Optimization, learning (artificial intelligence), load balancing scheduling, Load management, machine learning, machine learning algorithm, multicriteria decision, NP-complete problem, operations research, optimisation, Optimization, parallel computing, particle swarm optimization, Processor scheduling, pubcrawl, resource allocation, scheduling, scheduling technique, swarm intelligence, task makespan minimization, virtual machines

Cloud computing is the expansion of parallel computing, distributed computing. The technology of cloud computing becomes more and more widely used, and one of the fundamental issues in this cloud environment is related to task scheduling. However, scheduling in Cloud environments represents a difficult issue since it is basically NP-complete. Thus, many variants based on approximation techniques, especially those inspired by Swarm Intelligence (SI) have been proposed. This paper proposes a machine learning algorithm to guide the cloud choose the scheduling technique by using multi criteria decision to optimize the performance. The main contribution of our work is to minimize the makespan of a given task set. The new strategy is simulated using the CloudSim toolkit package where the impact of the algorithm is checked with different numbers of VMs varying from 2 to 50, and different task sizes between 30 bytes and 2700 bytes. Experiment results show that the proposed algorithm minimizes the execution time and the makespan between 7% and 75%, and improves the performance of the load balancing scheduling.

Citation Keyrjoub_cloud_2017