A Review on Various Job Scheduling Algorithm in Cloud Computing

Authors

  • Asst. Prof. Gaurang A. Patel Computer Science & Engineering Department, Dr. Jivraj Mehta Institute of Technology & Engineering, Mogar, Anand
  • Asst. Prof. Hitesh Vaghela Computer Science & Engineering Department, Dr. Jivraj Mehta Institute of Technology & Engineering, Mogar, Anand

Keywords:

Cloud Computing,Meta-Tasks, Makespan, Response Time andMin-Min algorithm

Abstract

For today’s most demanding service ofcloud computing,
there are many tasks requires to be executed by the available
resources to achieve best performance, shortest response time
and utilization of resources. To achieve these challenges there is a
need to design a new task scheduling algorithm that outperform
appropriate allocation map of task. In this paper, a systematic
review of various tasks scheduling algorithm is presented. These
algorithms have different perspective, working principles etc.
This study concludes that all the existing techniques mainly focus
on reducing service response time, minimize completion time,
maximize utilization of resources and improving performance
etc. There are many parameters can be mentioned as factor of
scheduling problem to be considered such as load balancing,
system throughput, service reliability, service cost, service
utilization and so forth.

Published

2022-04-27

How to Cite

Asst. Prof. Gaurang A. Patel, & Asst. Prof. Hitesh Vaghela. (2022). A Review on Various Job Scheduling Algorithm in Cloud Computing. International Journal of Advance Engineering and Research Development (IJAERD), 2(13), -. Retrieved from https://ijaerd.com/index.php/IJAERD/article/view/5701