期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2018
卷号：96
期号：17
出版社：Journal of Theoretical and Applied
摘要：Cloud computing offers opportunities to access remote physical and virtual resources. Due to the continuing development of cloud computing, many challenges face this technology. One of these challenges is tasks scheduling. It refers to the process of allocating users� tasks to virtual machines (VMs) with a goal of minimizing the turnaround time and improving the resource utilization. Tasks scheduling is considered NP hard problem with O(mn ) run time complexity to schedule n tasks on m resources. The process of tasks scheduling consumes a large solution space and with lacking of algorithms that can find the optimal solution in a polynomial run time. This paper presents a review study of various task scheduling algorithms in cloud environment including: RR, MaxMin, MinMin, FCFS, MCT, PSO, and GA, with a case study on modified round robin (MRR) algorithm. The MRR algorithm has been tested using CloudSim toolkit. The results show that when using the MRR algorithm to schedule a number of Cloudlets over a number of VMs, the average waiting of run time becomes less than when using RR in the same environments. Thus, it is advisable to use the proposed MRR for tasks scheduling in cloud computing, because it reduces the average waiting time and keeps the good features of the RR such as fairness, avoiding starvation, based on simple rule, dynamic based on CC environment situations, and suitable for load balancing.
