Open AccessTask Scheduling Algorithms in Cloud Computing: A Review
Author(s) -
Ibrahim Mahmood Ibrahim
Publication year - 2021
Publication title -
türk bilgisayar ve matematik eğitimi dergisi
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.218
H-Index - 3
ISSN - 1309-4653
DOI - 10.17762/turcomat.v12i4.612
Subject(s) - computer science , cloud computing , correctness , distributed computing , scheduling (production processes) , workload , fair share scheduling , dynamic priority scheduling , two level scheduling , rate monotonic scheduling , round robin scheduling , earliest deadline first scheduling , utility computing , fixed priority pre emptive scheduling , algorithm , quality of service , computer network , operating system , cloud computing security , mathematical optimization , mathematics
Cloud computing is the requirement based on clients and provides many resources that aim to share it as a service through the internet. For optimal use, Cloud computing resources such as storage, application, and other services need managing and scheduling these services. The principal idea behind the scheduling is to minimize loss time, workload, and maximize throughput. So, the scheduling task is essential to achieve accuracy and correctness on task completion. This paper gives an idea about various task scheduling algorithms in the cloud computing environment used by researchers. Finally, many authors applied different parameters like completion time, throughput, and cost to evaluate the system.