TR
EN
Workflow Scheduling for Cloud Computing Using Evolutionary Algorithm
Abstract
Cloud computing provides powerful, highly scalable, flexible resources for real world applications. It also reduces the cost and operation expenses. Workflow scheduling is important for getting higher performance, reducing cost and using resources more efficiently in cloud computing. Workflow scheduling in cloud systems assigns tasks to resources available in the system and aims to utilize cloud resources by decreasing makespan of the workflow. In this study, an evolutionary algorithm is proposed to solve workflow scheduling problem. The main objective of this work is to minimize the makespan of the schedule. To achieve this goal, problem specific crossover operator and mutation operators are proposed in the evolutionary algorithm. The crossover operator will combine the problem-specific information stored in both parents to create a new individual. The mutation operators will explore neighbor solutions using some intelligent search mechanisms. This unique design of the operators increases the diversity of the search space and the quality of the solutions. As a result, the workflow schedules obtained from the evolutionary algorithm decreases the makespan of the workflow in the cloud system. The performance of the proposed study is measured using well-known scientific workflows and is compared with the algorithms from the literature. The proposed study outperforms all related algorithms in 67% of the test cases and obtains the same results in the remaining test cases.
Keywords
Kaynakça
- [1] E. H. Houssein, A. G. Gad, Y. M. Wazery, and P. N. Suganthan, “Task Scheduling in Cloud Computing based on Meta-heuristics: Review, Taxonomy, Open Challenges, and Future Trends”, Swarm and Evolutionary Computation, 2021, 62.
- [2] M. R. Garey and D. S. Johnson, “A guide to the theory of np-completeness”, Computers and intractability, 1979, pp. 641–650.
- [3] R. Zarrouk, I. E. Bennour, and A. Jemai, “A two-level particle swarm optimization algorithm for the flexible job shop scheduling problem”, Swarm Intelligence, 2019, pp. 1–24.
- [4] N. Sadashiv, and S. D. Kumar, “Cluster, grid and cloud computing: A detailed comparison”, 2011 6th International Conference on Computer Science & Education (ICCSE), 2011, pp. 477–482.
- [5] S. H. H Madni, Latiff, M. S. A. Abdullahi, M., Abdulhamid, and M. Usman, “Performance comparison of heuristic algorithms for task scheduling in iaas cloud computing environment”, PLoS ONE, 2017, 12: 5.
- [6] A. Brandwajn, and T. Begin, “First-come-first-served queues with multiple servers and customer classes”, Performance Evaluation, 2019; 130, pp. 51–63.
- [7] H. Topcuoglu, S. Hariri, and M. Wu, “Performance-effective and low-complexity task scheduling for heterogeneous computing”, IEEE transactions on parallel and distributed systems, 2002, 13(3), pp. 260-274.
- [8] B. Li, L. Niu, X. Huang, H. Wu, and Y. Pei, “Minimum completion time offloading algorithm for mobile edge computing”, IEEE 4th International Conference on Computer and Communications (ICCC), IEEE, 2018, pp. 1929–1933.
Ayrıntılar
Birincil Dil
İngilizce
Konular
Evrimsel Hesaplama
Bölüm
Araştırma Makalesi
Erken Görünüm Tarihi
31 Aralık 2023
Yayımlanma Tarihi
31 Aralık 2023
Gönderilme Tarihi
1 Ağustos 2023
Kabul Tarihi
25 Kasım 2023
Yayımlandığı Sayı
Yıl 2023 Cilt: 14 Sayı: 4