Open AccessDynamic Task Scheduling based on Burst Time Requirement for Cloud Environment
Author(s) -
Linz Tom,
V. R. Bindu
Publication year - 2021
Publication title -
international journal of computer networks and communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.159
H-Index - 8
eISSN - 0975-2293
pISSN - 0974-9322
DOI - 10.5121/ijcnc.2021.13505
Subject(s) - computer science , cloud computing , allotment , distributed computing , scheduling (production processes) , job shop scheduling , task (project management) , dynamic priority scheduling , response time , real time computing , mathematical optimization , schedule , operating system , ecology , mathematics , management , economics , biology
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.