This paper is published in Volume-7, Issue-4, 2021
Area
Computer Science Engineering
Author
Gujjala Sai Lakshmi Namitha, Bindu Madhavi Siraparapu
Org/Univ
SRM Institute of Science and Technology, Chennai, Tamil Nadu, India
Pub. Date
21 July, 2021
Paper ID
V7I4-1414
Publisher
Keywords
ACO Algorithm, BCO Algorithm, Cloud Computing, Genetic Algorithm, PSO Algorithm, Task Scheduling

Citationsacebook

IEEE
Gujjala Sai Lakshmi Namitha, Bindu Madhavi Siraparapu. A study on various optimization algorithms for task scheduling in cloud computing, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.

APA
Gujjala Sai Lakshmi Namitha, Bindu Madhavi Siraparapu (2021). A study on various optimization algorithms for task scheduling in cloud computing. International Journal of Advance Research, Ideas and Innovations in Technology, 7(4) www.IJARIIT.com.

MLA
Gujjala Sai Lakshmi Namitha, Bindu Madhavi Siraparapu. "A study on various optimization algorithms for task scheduling in cloud computing." International Journal of Advance Research, Ideas and Innovations in Technology 7.4 (2021). www.IJARIIT.com.

Abstract

The prompt development of storage technologies, processing, and the internet’s success has made the computing resources more available, more influential, and cheaper than before. This drift in the technological field has paved way for the realization of a new computational model which is Cloud Computing. One of the most challenging problems faced in cloud computing is task scheduling, where the clients want their tasks to be finished as per the deadline within the shortest time possible. Task scheduling in the cloud is done based on various parameters such as priority, cost, time, bandwidth, resource utilization, performance, etc. The current work focuses on providing a detailed review of various optimization algorithms for scheduling in the cloud. This study is useful in understanding various optimization algorithms that are used for task scheduling, the way they behave and function. The algorithms presented here are mainly focused to minimize the computational cost and execution time thereby increasing the overall efficiency.