Task Scheduling Optimization in cloud computing by Cuckoo Search Algorithm

Document Type : Regular Articles

Authors

Faculty of Computers and Artificial Intelligence, Department of Computer Science, Sohag University, Sohag, 82524, Egypt.

Abstract

: In cloud computing systems, task scheduling is crucial. Task scheduling cannot be done based on a single criterion but rather on rules and regulations which can be referred to as an agreement between cloud customers and providers. This agreement is nothing more than the user's desire for the providers to offer the kind of service that they expect. Providing high-quality services to consumers under the deal is a critical duty for providers, who must also manage many responsibilities. The task scheduling problem may be considered the search for an ideal assignment or mapping of a collection of subtasks of distinct tasks across the available set of resources to meet the intended goals for tasks. This paper proposes an efficient scheduling task algorithm based on the cuckoo search algorithm in cloud computing systems. By applying it to three cases, we evaluate the performance of our algorithm. The findings suggest that the proposed strategy successfully achieved the best solution in makespan, speedup, efficiency, and throughput.

Keywords

Main Subjects


[1] Singh, R.M;  Paul, S. and  Kumar, A.; Task Scheduling in Cloud Computing : Review, International Journal of Computer Science and Information Technologies., 2014, 5 (6), 7940–7944.
[2] Guo, L.; Zhao, S.; Shen, S. and Jiang, C.; Task scheduling optimization in cloud computing based on heuristic Algorithm, Journal of Networks., 2012, 7 (3),  547–553.
[3] Kaur, S. and Verma, A.; An Efficient Approach to Genetic Algorithm for Task Scheduling in Cloud Computing Environment, International Journal of Information Technology and Computer Science., 2012, 4 (10), 74–79.
[4] Dasgupta, K.; Mandal, B.; Dutta, P.; Mandal, K.J and Dam, S.; A Genetic Algorithm (GA) based Load Balancing Strategy for Cloud Computing, Procedia Technology., 2013, 10, 340–347.
[5] Dhinesh Babu D.L and Venkata Krishna, P.; Honey bee behavior inspired load balancing of tasks in cloud computing environments, Applied Soft Computing., 2013, 13, 2292–2303.
[6] Xu, Y.; Li, K.; He, L.; Zhang, L. and Li, K.; A Hybrid Chemical Reaction Optimization Scheme for Task Scheduling on Heterogeneous Computing Systems, IEEE Transactions on Parallel and Distributed Systems., 2015, 26 (12), 3208–3222.
[7] Dordaie, N. and Navimipour, J.N; A hybrid particle swarm optimization and hill climbing algorithm for task scheduling in the cloud environments, ICT Express., 2018, 4, 199–202.
[8] Hamed, Y.A and Alkinani, M.H; Task scheduling optimization in cloud computing based on genetic algorithms, Computers, Materials and Continua., 2021, 69 (3), 3289–3301.
[9] Yang, S.X and Deb, S.; Cuckoo search via Lévy flights, 2009 World Congress on Nature and Biologically Inspired Computing (NABIC)., 2009, 210–214.
[10] Dubey, I. and Gupta, M.; Uniform mutation and SPV rule based optimized PSO algorithm for TSP problem, in Proc. of the 4th International Conference on Electronics and Communication Systems., Coimbatore, India, 2017, 168–172.
[11] Wang, L.; Pan, Q. and Tasgetiren M.F; A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem, Computers & Industrial Engineering., 2011, 61 (1), 76-83.
 [12] Kamalinia, A. and Ghaffari, A.; Hybrid Task Scheduling Method for Cloud Computing by Genetic and DE Algorithms, Wireless Pers Commun., 2017, 97, 6301–6323.
[13] Topcuoglu, H.; Hariri, S. and Wu Y.M; Performance-effective and low-complexity task scheduling for heterogeneous computing, IEEE Transactions on Parallel and Distributed Systems., 2002, 13,  260–274.
[14] Gupta, S.; Agarwal, G. and Kumar, V.; Task scheduling in multiprocessor system using genetic algorithm, 2010 2nd International Conference on Machine Learning and Computing., 2010, 267–271.
[15] Dubey, K.; Kumar, M. and Sharma C.S; Modified HEFT Algorithm for Task Scheduling in Cloud Environment, Procedia Computer Science., 2018, 125, 725–732.