Abstract
Background: Cloud computing environment is a novel paradigm in which the services
are hosted, delivered and managed over the internet. Tasks scheduling problem in the cloud has become
a very interesting research area. However, the problem is more complex and challenging due
to the dynamic nature of cloud and users’ needs as well as cloud providers’ requirements including
the quality of service, users’ priorities and computing capabilities.
Objective: The main objective is to solve the problem of tasks scheduling through an algorithm
which can not only improves the client satisfaction, but also allows cloud service provider to gain
maximum profit and ensure that the cloud resources are utilized efficiently.
Method: (a) Optimization of the waiting time and the queue length.
(b) Distribution of all requests into a novel queueing system in a dynamic manner based on a decision
threshold.
(c) Assignment of requests to VMs based on Particle Swarm Optimization and Simulated Annealing
algorithms.
(d) Incorporation of the priority constraint in the scheduling process by considering three priorities
levels including the tasks, queues and VMs.
Results: The results comparison of our algorithm with particle swarm optimization and First Come
First Serve algorithms demonstrate the effectiveness of our algorithm in terms of waiting time,
makespan, resources utilization and degree of imbalance.
Conclusion: This study introduces an efficient strategy to schedule users’ tasks by using dynamic
dispatch queues and particle swarm optimization with simulated annealing algorithms. Moreover, it
incorporates the priority issue in the scheduling process.
Keywords:
Cloud computing, particle swarm optimization, DDQ-SAPSO algorithm, DPDQ-SAPSO algorithm, task scheduling,
queueing system, simulated annealing.
Graphical Abstract
[1]
A. Shawish, and M. Salama, "Cloud computing: Paradigms and technologies", In: Inter-cooperative Collective Intelligence: Techniques and Applications.F. Xhafa and N. Bessis, eds.; Springer,Verlag, 2014, pp. 39-67.
[3]
P. Mell, and T. Grance, "The NIST definition of cloud computing", National Institute of Standards and Technology., September 2011.Available from:.https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-145.pdf
[6]
H. Ben Alla, S. Ben Alla, A. Ezzati, and A. Touhafi, "An efficient dynamic priority-queue algorithm based on AHP and PSO for task scheduling in cloud computing", In: Advances in Intelligent Systems and Computing., Springer: Cham, 2017, pp. 134-143.
[7]
J. Ma, W. Li, T. Fu, L. Yan, and G. Hu, "A novel dynamic task scheduling algorithm based on improved genetic algorithm in cloud computing", In: Wireless Communications, Networking and Applications., Springer: New Delhi, 2015, pp. 829-835.https://www.researchgate.net/deref/http%3A%2F%2Fdx.doi.org%2F10.1007%2F978-81-322-2580-5_75
[17]
M. Vijayalakshmi, and V.V. Kumar, Investigations on job scheduling algorithms in cloud computing, 2018. Available from: , http://www.ijarcst.com/conference/ first/ conf33.pdf
[22]
P. Komer, A. Abraham, and V. Snášel, Proceedings of the Fifth International Conference on Inno-vations in Bio-Inspired Computing and Applications IBICA 2014. Springer, Vol. 303, 2014
[23]
Y. Tan, Y. Shi, and B. Niu, "Advances in swarm intelligence", Lect. Notes Comput. Sci., 2014.
[29]
S. Ghanbari, and M. Othman, "A priority based job scheduling algorithm in cloud computing", Procedia Eng., vol. 50, pp. 778-785, 2012.
[30]
"Parallel Workloads Archive. Available from:", http://www.cs.huji.ac.il/ labs/ parallel/workload/
[34]
H. Ben, S. Ben Alla, A. Ezzati, and A. Mouhsen, "A novel architecture with dynamic queues based on fuzzy logic and particle swarm optimization algorithm for task scheduling in cloud computing", In: Advances in Ubiquitous Networking 2. UNet 2016. Lecture Notes in Electrical Engineering,. R. El-Azouzi, D. Menasche, E. Sabir, F.De Pellegrini and M. Benjillali, Eds.; Singapore: Springer, Vol. 397,2017.
[35]
"Parallel Workloads Archive", SDSC Blue Horizon.Available from:, http://www.cs.huji.ac.il/labs/parallel/workload/l_sdsc_blue/
[36]
"Web.iitd.ac.in. Available from: ", http://web.iitd.ac.in/~dharmar/virtuallab/Theory/QueuingNotes.pdf
[38]
"Parallel Workloads Archive: The Cornell Theory Center (CTC) IBM. Available from: ", http://www.cs.huji.ac.il/labs/parallel/workload/ l_ctc_sp2/ index.html