FUZZY BASED ANT COLONY OPTIMIZATION SCHEDULING IN CLOUD COMPUTING
Main Article Content
Abstract
Cloud computing is an Information Technology deployment model established on virtualization. Task scheduling states the set of rules for task allocations to an exact virtual machine in the cloud computing environment. However, task scheduling challenges such as optimal task scheduling performance solutions, are addressed in cloud computing. First, the cloud computing performance due to task scheduling is improved by proposing a Dynamic Weighted Round-Robin algorithm. This recommended DWRR algorithm improves the task scheduling performance by considering resource competencies, task priorities, and length. Second, a heuristic algorithm called Hybrid Particle Swarm Parallel Ant Colony Optimization is proposed to solve the task execution delay problem in DWRR based task scheduling. In the end, a fuzzy logic system is designed for HPSPACO that expands task scheduling in the cloud environment. A fuzzy method is proposed for the inertia weight update of the PSO and pheromone trails update of the PACO. Thus, the proposed Fuzzy Hybrid Particle Swarm Parallel Ant Colony Optimization on cloud computing achieves improved task scheduling by minimizing the execution and waiting time, system throughput, and maximizing resource utilization.
Downloads
Metrics
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
References
E. Meriam and N. T. Mediatron, “Multiple QoS priority-based scheduling in cloud computing,” in Signal,
Image, Video and Communications (ISIVC), International Symposium on IEEE, Tunis, Tunisia, pp. 276–281, 2016.
J. Yang, H. Xu, L. Pan, P. Jia, F. Long et al., “Task scheduling using Bayesian optimization algorithm for
heterogeneous computing environments,” Applied Soft Computing, vol. 11, no. 4, pp. 3297–3310, 2011.
P. Kaur and S. Mehta, “Resource provisioning and workflow scheduling in clouds using augmented Shuffled
Frog Leaping Algorithm,” Journal of Parallel and Distributed Computing, vol. 101, pp. 41–50, 2017.
S. Dubey and S. Agrawal, “QoS driven task scheduling in cloud computing,” International Journal of Computer
Applications Technology and Research, vol. 2, no. 5, pp. 595–600, 2013.
D. C. Devi and V. R. Uthariaraj, “Load balancing in cloud computing environment using improved weighted
round-robin algorithm for non-preemptive dependent tasks,” Scientific World Journal, vol. 2016, pp. 1–14, 2016.
G. Upadhye and T. Dange, “Cloud resource allocation as non-preemptive approach,” in Current Trends in
Engineering and Technology (ICCTET), 2nd International Conference on IEEE, Coimbatore, India, pp. 352–356,
P. Mathiyalagan, U. R. Dhepthie and S. N. Sivanandam, “Enhanced hybrid PSO-ACO algorithm for grid
scheduling,” International Journal on Soft Computing (IJCS), vol. 1, no. 1, pp. 54–59, 2010.
K. Etminani and M. Naghibzadeh, “A min-min max-min selective algorithm for grid task scheduling,” in
Internet, ICI 2007, 3rd IEEE/IFIP International Conference in Central Asia on IEEE, Tashkent, Uzbekistan, pp. 1–
, 2007.
A. K. Bardsiri and S. M. Hashemi, “A review of workflow scheduling in cloud computing environment,”
International Journal of Computer Science and Management Research, vol. 1, no. 3, pp. 348–351, 2012.
R. S. Chang, J. S. Chang and P. S. Lin, “An ant algorithm for balanced job scheduling in grids,” Future
Generation Computer Systems, vol. 25, no. 1, pp. 20–27, 2009.
C. Cheng, L. Li and Y. Wang, “An energy-saving task scheduling strategy based on vacation queuing theory
in cloud computing,” Tsinghua Science and Technology, vol. 20, no. 1, pp. 28–39, 2015.
M. Dorigo, M. Birattari and T. Stutzle, “Ant colony optimization,” IEEE Computational Intelligence Magazine,
vol. 1, no. 4, pp. 28–39, 2006.
M. Habibi and N. J. Navimipour, “Multi-objective task scheduling in cloud computing using an imperialist
competitive algorithm,” International Journal of Advanced Computer Science & Applications, vol. 1, no. 7, pp. 289–
, 2016.
A. E. Keshk, A. B. El-Sisi and M. A. Tawfeek, “Cloud task scheduling for load balancing based on intelligent
strategy,” International Journal of Intelligent Systems and Applications, vol. 6, no. 5, pp. 25–36, 2014.
W. Lin, C. Liang, J. Z. Wang and R. Buyya, “Bandwidth-aware divisible task scheduling for cloud computing,”
Software Practice and Experience, vol. 44, no. 2, pp. 163–174, 2014.
B. A. Hicham, B. A. Said and E. Abdellah, “A dynamic task scheduling algorithm for cloud computing
environment,” Recent Advances in Computer Science and Communications, vol. 13, no. 2, pp. 296–307, 2020.
S. K. Panda, S. S. Nanda and S. K. Bhoi, “A pair-based task scheduling algorithm for cloud computing
environment,” Journal of King Saud University - Computer and Information Sciences, 2018, https://doi.org/10.
/j.jksuci.2018.10.001.
M. Sardaraz and M. Tahir, “A parallel multi-objective genetic algorithm for scheduling scientific workflows in
cloud computing,” International Journal of Distributed Sensor Networks, vol. 16, no. 8, pp. 1–13, 2020.