For cloud environments, task scheduling focusing on the optimal completion time (makespan) is vital. Metaheuristic approaches can be used to produce efficient solutions that will provide important cost savings to both the cloud service provider and the clients. On the other hand, since there is a high probability of getting stuck in local minima in metaheuristic solutions due to the type of problem, it may not always be possible to quickly reach the optimal solution. This study, using a metaheuristic approach, proposes a solution based on the Cloneable Jellyfish Algorithm for optimal task distribution in cloud environments. The unique feature of the proposed algorithm is that it allows dynamic population growth to be carried out in a controlled manner in order not to get stuck in local minima during the exploration phase. In addition, this algorithm, which uses a different cloning mechanism so that similar candidates are not generated in the population growth, has made it possible to achieve the optimal solution in a shorter time. To observe the solution performance, cloud environment simulations created in the Cloudsim simulator have been used. In experiments, the success of the proposed solution compared to classical scheduling algorithms has been proven.
Task scheduling Cloud computing Metaheuristic Jellyfish algorithm
Birincil Dil | İngilizce |
---|---|
Konular | Mühendislik |
Bölüm | Makaleler |
Yazarlar | |
Yayımlanma Tarihi | 29 Eylül 2022 |
Yayımlandığı Sayı | Yıl 2022 Cilt: 11 Sayı: 3 |
Bu eser Creative Commons Atıf-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.