TY - GEN
T1 - Dynamic task scheduling algorithms in cloud computing
AU - Mashuqur Rahman Mazumder, A. K.M.
AU - Aslam Uddin, K. M.
AU - Arbe, Nafija
AU - Jahan, Lulumar
AU - Whaiduzzaman, Md
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/6
Y1 - 2019/6
N2 - Cloud computing refers to dynamically scalable infrastructure and virtualizes resources that allow the application to fulfil infinite demands with inexpensive and reliable services. Therefore, the service provider has to serve a large number of tasks. For elegant service to the tasks, there is a need for an efficient scheduling algorithm. Many algorithms have been developed for scheduling. However, most of the developed algorithm has conflicting objectives and its own limitation. Thus, one is efficient for one type of tasks at the same time inefficient to other kinds of tasks. In this paper, we have proposed a strategy which allocates the algorithms according to the type of task and reduces the conflicting objectives. We have analyzed a number of algorithms such as First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Max-Min, Min-Min. Finally, we have shown our proposed strategy which reduces the limitation of other algorithms, the tradeoff between the average waiting time and makespan.
AB - Cloud computing refers to dynamically scalable infrastructure and virtualizes resources that allow the application to fulfil infinite demands with inexpensive and reliable services. Therefore, the service provider has to serve a large number of tasks. For elegant service to the tasks, there is a need for an efficient scheduling algorithm. Many algorithms have been developed for scheduling. However, most of the developed algorithm has conflicting objectives and its own limitation. Thus, one is efficient for one type of tasks at the same time inefficient to other kinds of tasks. In this paper, we have proposed a strategy which allocates the algorithms according to the type of task and reduces the conflicting objectives. We have analyzed a number of algorithms such as First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Max-Min, Min-Min. Finally, we have shown our proposed strategy which reduces the limitation of other algorithms, the tradeoff between the average waiting time and makespan.
KW - cloud computing
KW - execution time
KW - makespan.
KW - waiting time
UR - http://www.scopus.com/inward/record.url?scp=85072828137&partnerID=8YFLogxK
U2 - 10.1109/ICECA.2019.8822020
DO - 10.1109/ICECA.2019.8822020
M3 - Conference contribution
AN - SCOPUS:85072828137
T3 - Proceedings of the 3rd International Conference on Electronics and Communication and Aerospace Technology, ICECA 2019
SP - 1280
EP - 1286
BT - Proceedings of the 3rd International Conference on Electronics and Communication and Aerospace Technology, ICECA 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd International Conference on Electronics and Communication and Aerospace Technology, ICECA 2019
Y2 - 12 June 2019 through 14 June 2019
ER -